var bibbase_data = {"data":"<img src=\"//bibbase.org/img/ajax-loader.gif\" id=\"spinner\"\n  style=\"display: none;\" alt=\"Loading..\" />\n\n<div id=\"bibbase\">\n\n  <script type=\"text/javascript\">\n    var bibbase = {\n      params: {\"bib\":\"https://bibbase.org/network/files/52xaJNXvSgauGDmZR\",\"noBootstrap\":\"1\",\"authorFirst\":\"1\",\"nocache\":\"1\",\"fullnames\":\"1\",\"theme\":\"bullets\",\"group0\":\"year\",\"group1\":\"type\",\"owner\":\"{}\",\"jsonp\":\"1\",\"host\":\"bibbase.org\"},\n      data: [{\"bibtype\":\"article\",\"type\":\"2\",\"tags\":\"na\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Karmoose\"],\"firstnames\":[\"Mohammed\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Misoczki\"],\"firstnames\":[\"Rafael\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Yang\"],\"firstnames\":[\"Lily\",\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Zhang\"],\"firstnames\":[\"Zhenliang\"],\"suffixes\":[]}],\"journal\":\"IEEE Communications Letters\",\"title\":\"Using mm-Waves for Secret Key Establishment\",\"year\":\"2019\",\"volume\":\"23\",\"number\":\"6\",\"pages\":\"1077-1080\",\"doi\":\"10.1109/LCOMM.2019.2909918\",\"bibtex\":\"@ARTICLE{8684919,\\n  type={2},\\n  tags={na},\\n  author={Karmoose, Mohammed and Fragouli, Christina and Diggavi, Suhas and Misoczki, Rafael and Yang, Lily L. and Zhang, Zhenliang},\\n  journal={IEEE Communications Letters}, \\n  title={Using mm-Waves for Secret Key Establishment}, \\n  year={2019},\\n  volume={23},\\n  number={6},\\n  pages={1077-1080},\\n  doi={10.1109/LCOMM.2019.2909918}}\\n\\n\\n\",\"author_short\":[\"Karmoose, M.\",\"Fragouli, C.\",\"Diggavi, S.\",\"Misoczki, R.\",\"Yang, L. L.\",\"Zhang, Z.\"],\"key\":\"8684919\",\"id\":\"8684919\",\"bibbaseid\":\"karmoose-fragouli-diggavi-misoczki-yang-zhang-usingmmwavesforsecretkeyestablishment-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"tags\":\"na\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Yahya\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"Martina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tuninetti\"],\"firstnames\":[\"Daniela\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"title\":\"Network Simplification in Half-Duplex: Building on Submodularity\",\"year\":\"2019\",\"volume\":\"65\",\"number\":\"10\",\"pages\":\"6801-6818\",\"doi\":\"10.1109/TIT.2019.2923994\",\"bibtex\":\"@ARTICLE{8742589,\\n  type={2},\\n  tags={na},\\n  author={Ezzeldin, Yahya H. and Cardone, Martina and Fragouli, Christina and Tuninetti, Daniela},\\n  journal={IEEE Transactions on Information Theory}, \\n  title={Network Simplification in Half-Duplex: Building on Submodularity}, \\n  year={2019},\\n  volume={65},\\n  number={10},\\n  pages={6801-6818},\\n  doi={10.1109/TIT.2019.2923994}}\\n\\n\\n\",\"author_short\":[\"Ezzeldin, Y. H.\",\"Cardone, M.\",\"Fragouli, C.\",\"Tuninetti, D.\"],\"key\":\"8742589\",\"id\":\"8742589\",\"bibbaseid\":\"ezzeldin-cardone-fragouli-tuninetti-networksimplificationinhalfduplexbuildingonsubmodularity-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"2\",\"tags\":\"na\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Song\"],\"firstnames\":[\"Linqi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Shah\"],\"firstnames\":[\"Devavrat\"],\"suffixes\":[]}],\"booktitle\":\"2019 IEEE International Symposium on Information Theory (ISIT)\",\"title\":\"Interactions Between Learning and Broadcasting in Wireless Recommendation Systems\",\"year\":\"2019\",\"volume\":\"\",\"number\":\"\",\"pages\":\"2549-2553\",\"doi\":\"10.1109/ISIT.2019.8849556\",\"bibtex\":\"@INPROCEEDINGS{8849556,\\n  type={2},\\n  tags={na},\\n  author={Song, Linqi and Fragouli, Christina and Shah, Devavrat},\\n  booktitle={2019 IEEE International Symposium on Information Theory (ISIT)}, \\n  title={Interactions Between Learning and Broadcasting in Wireless Recommendation Systems}, \\n  year={2019},\\n  volume={},\\n  number={},\\n  pages={2549-2553},\\n  doi={10.1109/ISIT.2019.8849556}}\\n\\n\\n\",\"author_short\":[\"Song, L.\",\"Fragouli, C.\",\"Shah, D.\"],\"key\":\"8849556\",\"id\":\"8849556\",\"bibbaseid\":\"song-fragouli-shah-interactionsbetweenlearningandbroadcastinginwirelessrecommendationsystems-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"tags\":\"network_coding\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Song\"],\"firstnames\":[\"Linqi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Zhao\"],\"firstnames\":[\"Tianchu\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"title\":\"A Pliable Index Coding Approach to Data Shuffling\",\"year\":\"2020\",\"volume\":\"66\",\"number\":\"3\",\"pages\":\"1333-1353\",\"doi\":\"10.1109/TIT.2019.2954338\",\"bibtex\":\"@ARTICLE{8906011,\\n  type={2},\\n  tags = {network_coding},\\n  author={Song, Linqi and Fragouli, Christina and Zhao, Tianchu},\\n  journal={IEEE Transactions on Information Theory}, \\n  title={A Pliable Index Coding Approach to Data Shuffling}, \\n  year={2020},\\n  volume={66},\\n  number={3},\\n  pages={1333-1353},\\n  doi={10.1109/TIT.2019.2954338}}\\n\\n\\n\",\"author_short\":[\"Song, L.\",\"Fragouli, C.\",\"Zhao, T.\"],\"key\":\"8906011\",\"id\":\"8906011\",\"bibbaseid\":\"song-fragouli-zhao-apliableindexcodingapproachtodatashuffling-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"tags\":\"na\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Karmoose\"],\"firstnames\":[\"Mohammed\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Song\"],\"firstnames\":[\"Linqi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"Martina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"title\":\"Privacy in Index Coding: $k$ -Limited-Access Schemes\",\"year\":\"2020\",\"volume\":\"66\",\"number\":\"5\",\"pages\":\"2625-2641\",\"doi\":\"10.1109/TIT.2019.2957577\",\"bibtex\":\"@ARTICLE{8922781,\\n  type={2},\\n  tags={na},\\n  author={Karmoose, Mohammed and Song, Linqi and Cardone, Martina and Fragouli, Christina},\\n  journal={IEEE Transactions on Information Theory}, \\n  title={Privacy in Index Coding:  $k$ -Limited-Access Schemes}, \\n  year={2020},\\n  volume={66},\\n  number={5},\\n  pages={2625-2641},\\n  doi={10.1109/TIT.2019.2957577}}\\n\\n\\n\",\"author_short\":[\"Karmoose, M.\",\"Song, L.\",\"Cardone, M.\",\"Fragouli, C.\"],\"key\":\"8922781\",\"id\":\"8922781\",\"bibbaseid\":\"karmoose-song-cardone-fragouli-privacyinindexcodingklimitedaccessschemes-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"2\",\"tags\":\"na\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Agarwal\"],\"firstnames\":[\"Gaurav\",\"Kumar\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"Martina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]}],\"booktitle\":\"2019 IEEE Information Theory Workshop (ITW)\",\"title\":\"On Secure Capacity of Multiple Unicast Traffic over Separable Networks\",\"year\":\"2019\",\"volume\":\"\",\"number\":\"\",\"pages\":\"1-5\",\"doi\":\"10.1109/ITW44776.2019.8988985\",\"bibtex\":\"@INPROCEEDINGS{8988985,\\n  type={2},\\n  tags={na},\\n  author={Agarwal, Gaurav Kumar and Cardone, Martina and Fragouli, Christina},\\n  booktitle={2019 IEEE Information Theory Workshop (ITW)}, \\n  title={On Secure Capacity of Multiple Unicast Traffic over Separable Networks}, \\n  year={2019},\\n  volume={},\\n  number={},\\n  pages={1-5},\\n  doi={10.1109/ITW44776.2019.8988985}}\\n\\n\\n\",\"author_short\":[\"Agarwal, G. K.\",\"Cardone, M.\",\"Fragouli, C.\"],\"key\":\"8988985\",\"id\":\"8988985\",\"bibbaseid\":\"agarwal-cardone-fragouli-onsecurecapacityofmultipleunicasttrafficoverseparablenetworks-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"tags\":\"na\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Yahya\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"Martina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tuninetti\"],\"firstnames\":[\"Daniela\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"title\":\"The Approximate Capacity of Half-Duplex Line Networks\",\"year\":\"2020\",\"volume\":\"66\",\"number\":\"7\",\"pages\":\"4449-4467\",\"doi\":\"10.1109/TIT.2020.2998184\",\"bibtex\":\"@ARTICLE{9103123,\\n  type={2},\\n  tags={na},\\n  author={Ezzeldin, Yahya H. and Cardone, Martina and Fragouli, Christina and Tuninetti, Daniela},\\n  journal={IEEE Transactions on Information Theory}, \\n  title={The Approximate Capacity of Half-Duplex Line Networks}, \\n  year={2020},\\n  volume={66},\\n  number={7},\\n  pages={4449-4467},\\n  doi={10.1109/TIT.2020.2998184}}\\n\\n\\n\",\"author_short\":[\"Ezzeldin, Y. H.\",\"Cardone, M.\",\"Fragouli, C.\",\"Tuninetti, D.\"],\"key\":\"9103123\",\"id\":\"9103123\",\"bibbaseid\":\"ezzeldin-cardone-fragouli-tuninetti-theapproximatecapacityofhalfduplexlinenetworks-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"tags\":\"security\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Mao\"],\"firstnames\":[\"Yanwen\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tabuada\"],\"firstnames\":[\"Paulo\"],\"suffixes\":[]}],\"journal\":\"IEEE Control Systems Letters\",\"title\":\"Secure State-Reconstruction Over Networks Subject to Attacks\",\"year\":\"2021\",\"volume\":\"5\",\"number\":\"1\",\"pages\":\"157-162\",\"doi\":\"10.1109/LCSYS.2020.3000853\",\"bibtex\":\"@ARTICLE{9112310,\\n  type={2},\\n  tags = {security},\\n  author={Mao, Yanwen and Diggavi, Suhas and Fragouli, Christina and Tabuada, Paulo},\\n  journal={IEEE Control Systems Letters}, \\n  title={Secure State-Reconstruction Over Networks Subject to Attacks}, \\n  year={2021},\\n  volume={5},\\n  number={1},\\n  pages={157-162},\\n  doi={10.1109/LCSYS.2020.3000853}}\\n\\n\\n\",\"author_short\":[\"Mao, Y.\",\"Diggavi, S.\",\"Fragouli, C.\",\"Tabuada, P.\"],\"key\":\"9112310\",\"id\":\"9112310\",\"bibbaseid\":\"mao-diggavi-fragouli-tabuada-securestatereconstructionovernetworkssubjecttoattacks-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":3,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"tags\":\"security\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Agarwal\"],\"firstnames\":[\"Gaurav\",\"Kumar\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Karmoose\"],\"firstnames\":[\"Mohammed\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tabuada\"],\"firstnames\":[\"Paulo\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Automatic Control\",\"title\":\"Distortion-Based Lightweight Security for Cyber-Physical Systems\",\"year\":\"2021\",\"volume\":\"66\",\"number\":\"4\",\"pages\":\"1588-1601\",\"doi\":\"10.1109/TAC.2020.3006814\",\"bibtex\":\"@ARTICLE{9133260,\\n  type={2},\\n  tags = {security},\\n  author={Agarwal, Gaurav Kumar and Karmoose, Mohammed and Diggavi, Suhas and Fragouli, Christina and Tabuada, Paulo},\\n  journal={IEEE Transactions on Automatic Control}, \\n  title={Distortion-Based Lightweight Security for Cyber-Physical Systems}, \\n  year={2021},\\n  volume={66},\\n  number={4},\\n  pages={1588-1601},\\n  doi={10.1109/TAC.2020.3006814}}\\n\\n\\n\",\"author_short\":[\"Agarwal, G. K.\",\"Karmoose, M.\",\"Diggavi, S.\",\"Fragouli, C.\",\"Tabuada, P.\"],\"key\":\"9133260\",\"id\":\"9133260\",\"bibbaseid\":\"agarwal-karmoose-diggavi-fragouli-tabuada-distortionbasedlightweightsecurityforcyberphysicalsystems-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"tags\":\"na\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Yahya\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Sengupta\"],\"firstnames\":[\"Ayan\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"title\":\"Wireless Network Simplification: The Performance of Routing\",\"year\":\"2020\",\"volume\":\"66\",\"number\":\"9\",\"pages\":\"5703-5711\",\"doi\":\"10.1109/TIT.2020.3010990\",\"bibtex\":\"@ARTICLE{9145607,\\n  type={2},\\n  tags={na},\\n  author={Ezzeldin, Yahya H. and Sengupta, Ayan and Fragouli, Christina},\\n  journal={IEEE Transactions on Information Theory}, \\n  title={Wireless Network Simplification: The Performance of Routing}, \\n  year={2020},\\n  volume={66},\\n  number={9},\\n  pages={5703-5711},\\n  doi={10.1109/TIT.2020.3010990}}\\n\\n\\n\",\"author_short\":[\"Ezzeldin, Y. H.\",\"Sengupta, A.\",\"Fragouli, C.\"],\"key\":\"9145607\",\"id\":\"9145607\",\"bibbaseid\":\"ezzeldin-sengupta-fragouli-wirelessnetworksimplificationtheperformanceofrouting-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"tags\":\"bio\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Srinivasavaradhan\"],\"firstnames\":[\"Sundara\",\"Rajan\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]}],\"booktitle\":\"2020 IEEE International Symposium on Information Theory (ISIT)\",\"title\":\"Equivalence of ML decoding to a continuous optimization problem\",\"year\":\"2020\",\"volume\":\"\",\"number\":\"\",\"pages\":\"343-348\",\"doi\":\"10.1109/ISIT44484.2020.9174130\",\"bibtex\":\"@INPROCEEDINGS{9174130,\\n  type={4},\\n  tags = {bio},\\n  author={Srinivasavaradhan, Sundara Rajan and Diggavi, Suhas and Fragouli, Christina},\\n  booktitle={2020 IEEE International Symposium on Information Theory (ISIT)}, \\n  title={Equivalence of ML decoding to a continuous optimization problem}, \\n  year={2020},\\n  volume={},\\n  number={},\\n  pages={343-348},\\n  doi={10.1109/ISIT44484.2020.9174130}}\\n\\n\\n\",\"author_short\":[\"Srinivasavaradhan, S. R.\",\"Diggavi, S.\",\"Fragouli, C.\"],\"key\":\"9174130\",\"id\":\"9174130\",\"bibbaseid\":\"srinivasavaradhan-diggavi-fragouli-equivalenceofmldecodingtoacontinuousoptimizationproblem-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"tags\":\"wireless\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Yahya\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"Martina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Caire\"],\"firstnames\":[\"Giuseppe\"],\"suffixes\":[]}],\"booktitle\":\"2020 IEEE International Symposium on Information Theory (ISIT)\",\"title\":\"Gaussian 1-2-1 Networks with Imperfect Beamforming\",\"year\":\"2020\",\"volume\":\"\",\"number\":\"\",\"pages\":\"1599-1604\",\"doi\":\"10.1109/ISIT44484.2020.9174233\",\"bibtex\":\"@INPROCEEDINGS{9174233,\\n  type={4},\\n  tags = {wireless},\\n  author={Ezzeldin, Yahya H. and Cardone, Martina and Fragouli, Christina and Caire, Giuseppe},\\n  booktitle={2020 IEEE International Symposium on Information Theory (ISIT)}, \\n  title={Gaussian 1-2-1 Networks with Imperfect Beamforming}, \\n  year={2020},\\n  volume={},\\n  number={},\\n  pages={1599-1604},\\n  doi={10.1109/ISIT44484.2020.9174233}}\\n\\n\\n\",\"author_short\":[\"Ezzeldin, Y. H.\",\"Cardone, M.\",\"Fragouli, C.\",\"Caire, G.\"],\"key\":\"9174233\",\"id\":\"9174233\",\"bibbaseid\":\"ezzeldin-cardone-fragouli-caire-gaussian121networkswithimperfectbeamforming-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"tags\":\"na\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Li\"],\"firstnames\":[\"Tan\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Song\"],\"firstnames\":[\"Linqi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]}],\"booktitle\":\"2020 IEEE International Symposium on Information Theory (ISIT)\",\"title\":\"Federated Recommendation System via Differential Privacy\",\"year\":\"2020\",\"volume\":\"\",\"number\":\"\",\"pages\":\"2592-2597\",\"doi\":\"10.1109/ISIT44484.2020.9174297\",\"bibtex\":\"@INPROCEEDINGS{9174297,\\n  type={4},\\n  tags = {na},\\n  author={Li, Tan and Song, Linqi and Fragouli, Christina},\\n  booktitle={2020 IEEE International Symposium on Information Theory (ISIT)}, \\n  title={Federated Recommendation System via Differential Privacy}, \\n  year={2020},\\n  volume={},\\n  number={},\\n  pages={2592-2597},\\n  doi={10.1109/ISIT44484.2020.9174297}}\\n\\n\\n\",\"author_short\":[\"Li, T.\",\"Song, L.\",\"Fragouli, C.\"],\"key\":\"9174297\",\"id\":\"9174297\",\"bibbaseid\":\"li-song-fragouli-federatedrecommendationsystemviadifferentialprivacy-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"tags\":\"bio,channel_coding\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Srinivasavaradhan\"],\"firstnames\":[\"Sundara\",\"Rajan\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Du\"],\"firstnames\":[\"Michelle\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"title\":\"Algorithms for Reconstruction Over Single and Multiple Deletion Channels\",\"year\":\"2021\",\"volume\":\"67\",\"number\":\"6\",\"pages\":\"3389-3410\",\"doi\":\"10.1109/TIT.2020.3033513\",\"bibtex\":\"@ARTICLE{9239329,\\n  type={2},\\n  tags = {bio,channel_coding},\\n  author={Srinivasavaradhan, Sundara Rajan and Du, Michelle and Diggavi, Suhas N. and Fragouli, Christina},\\n  journal={IEEE Transactions on Information Theory}, \\n  title={Algorithms for Reconstruction Over Single and Multiple Deletion Channels}, \\n  year={2021},\\n  volume={67},\\n  number={6},\\n  pages={3389-3410},\\n  doi={10.1109/TIT.2020.3033513}}\\n\\n\\n\",\"author_short\":[\"Srinivasavaradhan, S. R.\",\"Du, M.\",\"Diggavi, S. N.\",\"Fragouli, C.\"],\"key\":\"9239329\",\"id\":\"9239329\",\"bibbaseid\":\"srinivasavaradhan-du-diggavi-fragouli-algorithmsforreconstructionoversingleandmultipledeletionchannels-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":5,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"tags\":\"wireless\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Yahya\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"Martina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Caire\"],\"firstnames\":[\"Giuseppe\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"title\":\"Gaussian 1-2-1 Networks: Capacity Results for mmWave Communications\",\"year\":\"2021\",\"volume\":\"67\",\"number\":\"2\",\"pages\":\"961-990\",\"doi\":\"10.1109/TIT.2020.3034569\",\"bibtex\":\"@ARTICLE{9244138,\\n  type={2},\\n  tags = {wireless},\\n  author={Ezzeldin, Yahya H. and Cardone, Martina and Fragouli, Christina and Caire, Giuseppe},\\n  journal={IEEE Transactions on Information Theory}, \\n  title={Gaussian 1-2-1 Networks: Capacity Results for mmWave Communications}, \\n  year={2021},\\n  volume={67},\\n  number={2},\\n  pages={961-990},\\n  doi={10.1109/TIT.2020.3034569}}\\n\\n\\n\",\"author_short\":[\"Ezzeldin, Y. H.\",\"Cardone, M.\",\"Fragouli, C.\",\"Caire, G.\"],\"key\":\"9244138\",\"id\":\"9244138\",\"bibbaseid\":\"ezzeldin-cardone-fragouli-caire-gaussian121networkscapacityresultsformmwavecommunications-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"tags\":\"na\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Girgis\"],\"firstnames\":[\"Antonious\",\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Data\"],\"firstnames\":[\"Deepesh\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Chaudhuri\"],\"firstnames\":[\"Kamalika\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]}],\"journal\":\"IEEE Journal on Selected Areas in Information Theory\",\"title\":\"Successive Refinement of Privacy\",\"year\":\"2020\",\"volume\":\"1\",\"number\":\"3\",\"pages\":\"745-759\",\"doi\":\"10.1109/JSAIT.2020.3040403\",\"bibtex\":\"@ARTICLE{9270285,\\n  type={2},\\n  tags={na},\\n  author={Girgis, Antonious M. and Data, Deepesh and Chaudhuri, Kamalika and Fragouli, Christina and Diggavi, Suhas N.},\\n  journal={IEEE Journal on Selected Areas in Information Theory}, \\n  title={Successive Refinement of Privacy}, \\n  year={2020},\\n  volume={1},\\n  number={3},\\n  pages={745-759},\\n  doi={10.1109/JSAIT.2020.3040403}}\\n\\n\\n\",\"author_short\":[\"Girgis, A. M.\",\"Data, D.\",\"Chaudhuri, K.\",\"Fragouli, C.\",\"Diggavi, S. N.\"],\"key\":\"9270285\",\"id\":\"9270285\",\"bibbaseid\":\"girgis-data-chaudhuri-fragouli-diggavi-successiverefinementofprivacy-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Song\"],\"firstnames\":[\"Xiaoshen\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Yahya\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Caire\"],\"firstnames\":[\"Giuseppe\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Communications\",\"title\":\"Efficient Beam Scheduling for Half-Duplex mmWave Relay Networks\",\"year\":\"2021\",\"volume\":\"69\",\"number\":\"9\",\"tags\":\"wireless\",\"pages\":\"5773-5789\",\"doi\":\"10.1109/TCOMM.2021.3087203\",\"bibtex\":\"@ARTICLE{9448027,\\ntype={2},\\n  author={Song, Xiaoshen and Ezzeldin, Yahya H. and Caire, Giuseppe and Fragouli, Christina},\\n  journal={IEEE Transactions on Communications}, \\n  title={Efficient Beam Scheduling for Half-Duplex mmWave Relay Networks}, \\n  year={2021},\\n  volume={69},\\n  number={9},\\n  tags = {wireless},\\n  pages={5773-5789},\\n  doi={10.1109/TCOMM.2021.3087203}}\\n\\n\\n\",\"author_short\":[\"Song, X.\",\"Ezzeldin, Y. H.\",\"Caire, G.\",\"Fragouli, C.\"],\"key\":\"9448027\",\"id\":\"9448027\",\"bibbaseid\":\"song-ezzeldin-caire-fragouli-efficientbeamschedulingforhalfduplexmmwaverelaynetworks-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Yahya\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"Martina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]}],\"booktitle\":\"2020 IEEE Information Theory Workshop (ITW)\",\"title\":\"Multilevel Secrecy over 1-2-1 Networks\",\"year\":\"2021\",\"volume\":\"\",\"number\":\"\",\"tags\":\"wireless,security\",\"pages\":\"1-5\",\"doi\":\"10.1109/ITW46852.2021.9457663\",\"bibtex\":\"@INPROCEEDINGS{9457663,\\n  type={4},\\n  author={Ezzeldin, Yahya H. and Cardone, Martina and Fragouli, Christina},\\n  booktitle={2020 IEEE Information Theory Workshop (ITW)}, \\n  title={Multilevel Secrecy over 1-2-1 Networks}, \\n  year={2021},\\n  volume={},\\n  number={},\\n  tags = {wireless,security},\\n  pages={1-5},\\n  doi={10.1109/ITW46852.2021.9457663}}\\n\\n\\n\",\"author_short\":[\"Ezzeldin, Y. H.\",\"Cardone, M.\",\"Fragouli, C.\"],\"key\":\"9457663\",\"id\":\"9457663\",\"bibbaseid\":\"ezzeldin-cardone-fragouli-multilevelsecrecyover121networks-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":4,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"tags\":\"wireless,mine\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Dogan\"],\"firstnames\":[\"Mine\",\"Gokce\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Yahya\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]}],\"booktitle\":\"2021 IEEE International Symposium on Information Theory (ISIT)\",\"title\":\"On optimal relay placement in directional networks\",\"year\":\"2021\",\"volume\":\"\",\"number\":\"\",\"pages\":\"3156-3161\",\"doi\":\"10.1109/ISIT45174.2021.9517757\",\"bibtex\":\"@INPROCEEDINGS{9517757,\\n  type={4},\\n  tags={wireless,mine},\\n  author={Dogan, Mine Gokce and Ezzeldin, Yahya H. and Fragouli, Christina},\\n  booktitle={2021 IEEE International Symposium on Information Theory (ISIT)}, \\n  title={On optimal relay placement in directional networks}, \\n  year={2021},\\n  volume={},\\n  number={},\\n  pages={3156-3161},\\n  doi={10.1109/ISIT45174.2021.9517757}}\\n\\n\\n\",\"author_short\":[\"Dogan, M. G.\",\"Ezzeldin, Y. H.\",\"Fragouli, C.\"],\"key\":\"9517757\",\"id\":\"9517757\",\"bibbaseid\":\"dogan-ezzeldin-fragouli-onoptimalrelayplacementindirectionalnetworks-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"tags\":\"group_testing,pavlos\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Srinivasavaradhan\"],\"firstnames\":[\"Sundara\",\"Rajan\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Nikolopoulos\"],\"firstnames\":[\"Pavlos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]}],\"booktitle\":\"2021 IEEE International Symposium on Information Theory (ISIT)\",\"title\":\"An entropy reduction approach to continual testing\",\"year\":\"2021\",\"volume\":\"\",\"number\":\"\",\"pages\":\"611-616\",\"doi\":\"10.1109/ISIT45174.2021.9518188\",\"bibtex\":\"@INPROCEEDINGS{9518188,\\n  type={4},\\n  tags={group_testing,pavlos},\\n  author={Srinivasavaradhan, Sundara Rajan and Nikolopoulos, Pavlos and Fragouli, Christina and Diggavi, Suhas},\\n  booktitle={2021 IEEE International Symposium on Information Theory (ISIT)}, \\n  title={An entropy reduction approach to continual testing}, \\n  year={2021},\\n  volume={},\\n  number={},\\n  pages={611-616},\\n  doi={10.1109/ISIT45174.2021.9518188}}\\n\\n\\n\",\"author_short\":[\"Srinivasavaradhan, S. R.\",\"Nikolopoulos, P.\",\"Fragouli, C.\",\"Diggavi, S.\"],\"key\":\"9518188\",\"id\":\"9518188\",\"bibbaseid\":\"srinivasavaradhan-nikolopoulos-fragouli-diggavi-anentropyreductionapproachtocontinualtesting-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"tags\":\"ML_CC\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hanna\"],\"firstnames\":[\"Osama\",\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Yahya\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]}],\"journal\":\"IEEE Journal on Selected Areas in Information Theory\",\"title\":\"Quantization of Distributed Data for Learning\",\"year\":\"2021\",\"volume\":\"2\",\"number\":\"3\",\"pages\":\"987-1001\",\"doi\":\"10.1109/JSAIT.2021.3105359\",\"bibtex\":\"@ARTICLE{9521982,\\n  type={2},\\n  tags={osama},\\n  author={Hanna, Osama A. and Ezzeldin, Yahya H. and Fragouli, Christina and Diggavi, Suhas},\\n  journal={IEEE Journal on Selected Areas in Information Theory}, \\n  title={Quantization of Distributed Data for Learning}, \\n  year={2021},\\n  volume={2},\\n  number={3},\\n  pages={987-1001},\\n  tags = {ML_CC},\\n  doi={10.1109/JSAIT.2021.3105359}}\\n\\n\\n\",\"author_short\":[\"Hanna, O. A.\",\"Ezzeldin, Y. H.\",\"Fragouli, C.\",\"Diggavi, S.\"],\"key\":\"9521982\",\"id\":\"9521982\",\"bibbaseid\":\"hanna-ezzeldin-fragouli-diggavi-quantizationofdistributeddataforlearning-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":7,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"tags\":\"group_testing,pavlos\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Nikolopoulos\"],\"firstnames\":[\"Pavlos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Srinivasavaradhan\"],\"firstnames\":[\"Sundara\",\"Rajan\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]}],\"journal\":\"IEEE BITS the Information Theory Magazine\",\"title\":\"Group Testing for Community Infections\",\"year\":\"2021\",\"volume\":\"1\",\"number\":\"1\",\"pages\":\"57-68\",\"doi\":\"10.1109/MBITS.2021.3126244\",\"bibtex\":\"@ARTICLE{9609622,\\n  type={2},\\n  tags={group_testing,pavlos},\\n  author={Nikolopoulos, Pavlos and Srinivasavaradhan, Sundara Rajan and Fragouli, Christina and Diggavi, Suhas N.},\\n  journal={IEEE BITS the Information Theory Magazine}, \\n  title={Group Testing for Community Infections}, \\n  year={2021},\\n  volume={1},\\n  number={1},\\n  pages={57-68},\\n  doi={10.1109/MBITS.2021.3126244}}\\n\\n\\n\",\"author_short\":[\"Nikolopoulos, P.\",\"Srinivasavaradhan, S. R.\",\"Fragouli, C.\",\"Diggavi, S. N.\"],\"key\":\"9609622\",\"id\":\"9609622\",\"bibbaseid\":\"nikolopoulos-srinivasavaradhan-fragouli-diggavi-grouptestingforcommunityinfections-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":4,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"tags\":\"na\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Bunton\"],\"firstnames\":[\"Jonathan\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Anevlavis\"],\"firstnames\":[\"Tzanis\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Verma\"],\"firstnames\":[\"Gunjan\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tabuada\"],\"firstnames\":[\"Paulo\"],\"suffixes\":[]}],\"booktitle\":\"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)\",\"title\":\"Split to win: near-optimal sensor network synthesis via path-greedy subproblems\",\"year\":\"2021\",\"volume\":\"\",\"number\":\"\",\"pages\":\"789-794\",\"doi\":\"10.1109/MILCOM52596.2021.9652975\",\"bibtex\":\"@INPROCEEDINGS{9652975,\\n  type={4},\\n  tags = {na},\\n  author={Bunton, Jonathan and Anevlavis, Tzanis and Verma, Gunjan and Fragouli, Christina and Tabuada, Paulo},\\n  booktitle={MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)}, \\n  title={Split to win: near-optimal sensor network synthesis via path-greedy subproblems}, \\n  year={2021},\\n  volume={},\\n  number={},\\n  pages={789-794},\\n  doi={10.1109/MILCOM52596.2021.9652975}}\\n\\n\\n\",\"author_short\":[\"Bunton, J.\",\"Anevlavis, T.\",\"Verma, G.\",\"Fragouli, C.\",\"Tabuada, P.\"],\"key\":\"9652975\",\"id\":\"9652975\",\"bibbaseid\":\"bunton-anevlavis-verma-fragouli-tabuada-splittowinnearoptimalsensornetworksynthesisviapathgreedysubproblems-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"tags\":\"wireless,mine\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Dogan\"],\"firstnames\":[\"Mine\",\"Gokce\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Yahya\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Bohannon\"],\"firstnames\":[\"Addison\",\"W.\"],\"suffixes\":[]}],\"booktitle\":\"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)\",\"title\":\"A Reinforcement Learning Approach for Scheduling in mmWave Networks\",\"year\":\"2021\",\"volume\":\"\",\"number\":\"\",\"pages\":\"771-776\",\"doi\":\"10.1109/MILCOM52596.2021.9653135\",\"bibtex\":\"@INPROCEEDINGS{9653135,\\n  type={4},\\n  tags = {wireless,mine},\\n  author={Dogan, Mine Gokce and Ezzeldin, Yahya H. and Fragouli, Christina and Bohannon, Addison W.},\\n  booktitle={MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)}, \\n  title={A Reinforcement Learning Approach for Scheduling in mmWave Networks}, \\n  year={2021},\\n  volume={},\\n  number={},\\n  pages={771-776},\\n  doi={10.1109/MILCOM52596.2021.9653135}}\\n\\n\",\"author_short\":[\"Dogan, M. G.\",\"Ezzeldin, Y. H.\",\"Fragouli, C.\",\"Bohannon, A. W.\"],\"key\":\"9653135\",\"id\":\"9653135\",\"bibbaseid\":\"dogan-ezzeldin-fragouli-bohannon-areinforcementlearningapproachforschedulinginmmwavenetworks-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"tags\":\"wireless,mine\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Dogan\"],\"firstnames\":[\"Mine\",\"Gokce\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"Martina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]}],\"booktitle\":\"2022 IEEE International Symposium on Information Theory (ISIT)\",\"title\":\"Proactive Resilience in 1-2-1 Networks\",\"year\":\"2022\",\"volume\":\"\",\"number\":\"\",\"pages\":\"3220-3225\",\"doi\":\"10.1109/ISIT50566.2022.9834416\",\"bibtex\":\"@INPROCEEDINGS{9834416,\\n  type={4},\\n  tags={wireless,mine},\\n  author={Dogan, Mine Gokce and Cardone, Martina and Fragouli, Christina},\\n  booktitle={2022 IEEE International Symposium on Information Theory (ISIT)}, \\n  title={Proactive Resilience in 1-2-1 Networks}, \\n  year={2022},\\n  volume={},\\n  number={},\\n  pages={3220-3225},\\n  doi={10.1109/ISIT50566.2022.9834416}}\\n\\n\\n\",\"author_short\":[\"Dogan, M. G.\",\"Cardone, M.\",\"Fragouli, C.\"],\"key\":\"9834416\",\"id\":\"9834416\",\"bibbaseid\":\"dogan-cardone-fragouli-proactiveresiliencein121networks-2022\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"tags\":\"group_testing,pavlos\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Srinivasavaradhan\"],\"firstnames\":[\"Sundara\",\"Rajan\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Nikolopoulos\"],\"firstnames\":[\"Pavlos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]}],\"booktitle\":\"2022 IEEE International Symposium on Information Theory (ISIT)\",\"title\":\"Improving Group Testing via Gradient Descent\",\"year\":\"2022\",\"volume\":\"\",\"number\":\"\",\"pages\":\"2243-2248\",\"doi\":\"10.1109/ISIT50566.2022.9834577\",\"bibtex\":\"@INPROCEEDINGS{9834577,\\n  type={4},\\n  tags={group_testing,pavlos},\\n  author={Srinivasavaradhan, Sundara Rajan and Nikolopoulos, Pavlos and Fragouli, Christina and Diggavi, Suhas},\\n  booktitle={2022 IEEE International Symposium on Information Theory (ISIT)}, \\n  title={Improving Group Testing via Gradient Descent}, \\n  year={2022},\\n  volume={},\\n  number={},\\n  pages={2243-2248},\\n  doi={10.1109/ISIT50566.2022.9834577}}\\n\\n\\n\\n\",\"author_short\":[\"Srinivasavaradhan, S. R.\",\"Nikolopoulos, P.\",\"Fragouli, C.\",\"Diggavi, S.\"],\"key\":\"9834577\",\"id\":\"9834577\",\"bibbaseid\":\"srinivasavaradhan-nikolopoulos-fragouli-diggavi-improvinggrouptestingviagradientdescent-2022\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":10,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"tags\":\"ML_CC,osama,xinlin\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hanna\"],\"firstnames\":[\"Osama\",\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Li\"],\"firstnames\":[\"Xinlin\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]}],\"booktitle\":\"2022 IEEE International Symposium on Information Theory (ISIT)\",\"title\":\"Can we break the dependency in distributed detection?\",\"year\":\"2022\",\"volume\":\"\",\"number\":\"\",\"pages\":\"2720-2725\",\"doi\":\"10.1109/ISIT50566.2022.9834790\",\"bibtex\":\"@INPROCEEDINGS{9834790,\\n  type={4},\\n  tags={ML_CC,osama,xinlin},\\n  author={Hanna, Osama A. and Li, Xinlin and Fragouli, Christina and Diggavi, Suhas},\\n  booktitle={2022 IEEE International Symposium on Information Theory (ISIT)}, \\n  title={Can we break the dependency in distributed detection?}, \\n  year={2022},\\n  volume={},\\n  number={},\\n  pages={2720-2725},\\n  doi={10.1109/ISIT50566.2022.9834790}}\\n\\n\\n\",\"author_short\":[\"Hanna, O. A.\",\"Li, X.\",\"Fragouli, C.\",\"Diggavi, S.\"],\"key\":\"9834790\",\"id\":\"9834790\",\"bibbaseid\":\"hanna-li-fragouli-diggavi-canwebreakthedependencyindistributeddetection-2022\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":7,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"tags\":\"group_testing,pavlos\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Srinivasavaradhan\"],\"firstnames\":[\"Sundara\",\"Rajan\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Nikolopoulos\"],\"firstnames\":[\"Pavlos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]}],\"booktitle\":\"2022 IEEE International Symposium on Information Theory (ISIT)\",\"title\":\"Dynamic group testing to control and monitor disease progression in a population\",\"year\":\"2022\",\"volume\":\"\",\"number\":\"\",\"pages\":\"2255-2260\",\"doi\":\"10.1109/ISIT50566.2022.9834823\",\"bibtex\":\"@INPROCEEDINGS{9834823,\\n  type={4},\\n  tags = {group_testing,pavlos},\\n  author={Srinivasavaradhan, Sundara Rajan and Nikolopoulos, Pavlos and Fragouli, Christina and Diggavi, Suhas},\\n  booktitle={2022 IEEE International Symposium on Information Theory (ISIT)}, \\n  title={Dynamic group testing to control and monitor disease progression in a population}, \\n  year={2022},\\n  volume={},\\n  number={},\\n  pages={2255-2260},\\n  doi={10.1109/ISIT50566.2022.9834823}}\\n\\n\\n\\n\",\"author_short\":[\"Srinivasavaradhan, S. R.\",\"Nikolopoulos, P.\",\"Fragouli, C.\",\"Diggavi, S.\"],\"key\":\"9834823\",\"id\":\"9834823\",\"bibbaseid\":\"srinivasavaradhan-nikolopoulos-fragouli-diggavi-dynamicgrouptestingtocontrolandmonitordiseaseprogressioninapopulation-2022\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"tags\":\"chaorui,pavlos\",\"title\":\"A Diagonal Splitting Algorithm for Adaptive Group Testing\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Yao\"],\"firstnames\":[\"Chaorui\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Nikolopoulos\"],\"firstnames\":[\"Pavlos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]}],\"booktitle\":\"2023 IEEE International Symposium on Information Theory (ISIT)\",\"pages\":\"1842–1847\",\"year\":\"2023\",\"organization\":\"IEEE\",\"doi\":\"10.1109/ISIT54713.2023.10206936\",\"bibtex\":\"@inproceedings{yao2023diagonal,\\n  type={4},\\n  tags={chaorui,pavlos},\\n  title={A Diagonal Splitting Algorithm for Adaptive Group Testing},\\n  author={Yao, Chaorui and Nikolopoulos, Pavlos and Fragouli, Christina},\\n  booktitle={2023 IEEE International Symposium on Information Theory (ISIT)},\\n  pages={1842--1847},\\n  year={2023},\\n  organization={IEEE},\\n  doi={10.1109/ISIT54713.2023.10206936}\\n}\\n\\n\",\"author_short\":[\"Yao, C.\",\"Nikolopoulos, P.\",\"Fragouli, C.\"],\"key\":\"yao2023diagonal\",\"id\":\"yao2023diagonal\",\"bibbaseid\":\"yao-nikolopoulos-fragouli-adiagonalsplittingalgorithmforadaptivegrouptesting-2023\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"tags\":\"xinlin,osama\",\"title\":\"Common information dimension\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hanna\"],\"firstnames\":[\"Osama\",\"A\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Li\"],\"firstnames\":[\"Xinlin\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]}],\"booktitle\":\"2023 IEEE International Symposium on Information Theory (ISIT)\",\"pages\":\"406–411\",\"year\":\"2023\",\"organization\":\"IEEE\",\"bibtex\":\"@inproceedings{hanna2023common,\\n  type={4},\\n  tags={xinlin,osama},\\n  title={Common information dimension},\\n  author={Hanna, Osama A and Li, Xinlin and Diggavi, Suhas and Fragouli, Christina},\\n  booktitle={2023 IEEE International Symposium on Information Theory (ISIT)},\\n  pages={406--411},\\n  year={2023},\\n  organization={IEEE}\\n}\\n\\n\",\"author_short\":[\"Hanna, O. A\",\"Li, X.\",\"Diggavi, S.\",\"Fragouli, C.\"],\"key\":\"hanna2023common\",\"id\":\"hanna2023common\",\"bibbaseid\":\"hanna-li-diggavi-fragouli-commoninformationdimension-2023\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"tags\":\"osama\",\"title\":\"On Coded Broadcasting for Wireless Recommendation Systems\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Vestergaard\"],\"firstnames\":[\"Rasmus\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hanna\"],\"firstnames\":[\"Osama\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Song\"],\"firstnames\":[\"Linqi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Lucani\"],\"firstnames\":[\"Daniel\",\"E\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]}],\"booktitle\":\"ICC 2021-IEEE International Conference on Communications\",\"pages\":\"1–6\",\"year\":\"2021\",\"organization\":\"IEEE\",\"bibtex\":\"@inproceedings{vestergaard2021coded,\\n  tags={osama},\\n  title={On Coded Broadcasting for Wireless Recommendation Systems},\\n  author={Vestergaard, Rasmus and Hanna, Osama and Song, Linqi and Lucani, Daniel E and Fragouli, Christina},\\n  booktitle={ICC 2021-IEEE International Conference on Communications},\\n  pages={1--6},\\n  year={2021},\\n  organization={IEEE}\\n}\\n\\n\",\"author_short\":[\"Vestergaard, R.\",\"Hanna, O.\",\"Song, L.\",\"Lucani, D. E\",\"Fragouli, C.\"],\"key\":\"vestergaard2021coded\",\"id\":\"vestergaard2021coded\",\"bibbaseid\":\"vestergaard-hanna-song-lucani-fragouli-oncodedbroadcastingforwirelessrecommendationsystems-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"tags\":\"osama\",\"title\":\"Compression for Multi-Arm Bandits\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hanna\"],\"firstnames\":[\"Osama\",\"A\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Yang\"],\"firstnames\":[\"Lin\",\"F\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]}],\"journal\":\"IEEE Journal on Selected Areas in Information Theory\",\"year\":\"2023\",\"publisher\":\"IEEE\",\"bibtex\":\"@article{hanna2023compression,\\n  tags={osama},\\n  title={Compression for Multi-Arm Bandits},\\n  author={Hanna, Osama A and Yang, Lin F and Fragouli, Christina},\\n  journal={IEEE Journal on Selected Areas in Information Theory},\\n  year={2023},\\n  publisher={IEEE}\\n}\\n\\n\",\"author_short\":[\"Hanna, O. A\",\"Yang, L. F\",\"Fragouli, C.\"],\"key\":\"hanna2023compression\",\"id\":\"hanna2023compression\",\"bibbaseid\":\"hanna-yang-fragouli-compressionformultiarmbandits-2023\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"tags\":\"osama\",\"title\":\"Random access schemes in wireless systems with correlated user activity\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Kalor\"],\"firstnames\":[\"Anders\",\"E\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hanna\"],\"firstnames\":[\"Osama\",\"A\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Popovski\"],\"firstnames\":[\"Petar\"],\"suffixes\":[]}],\"booktitle\":\"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)\",\"pages\":\"1–5\",\"year\":\"2018\",\"organization\":\"IEEE\",\"bibtex\":\"@inproceedings{kalor2018random,\\n  tags={osama},\\n  title={Random access schemes in wireless systems with correlated user activity},\\n  author={Kalor, Anders E and Hanna, Osama A and Popovski, Petar},\\n  booktitle={2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)},\\n  pages={1--5},\\n  year={2018},\\n  organization={IEEE}\\n}\\n\\n\",\"author_short\":[\"Kalor, A. E\",\"Hanna, O. A\",\"Popovski, P.\"],\"key\":\"kalor2018random\",\"id\":\"kalor2018random\",\"bibbaseid\":\"kalor-hanna-popovski-randomaccessschemesinwirelesssystemswithcorrelateduseractivity-2018\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"tags\":\"osama\",\"title\":\"Random Access Schemes in Wireless Systems With Correlated User Activity\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ellersgaard\",\"Kalør\"],\"firstnames\":[\"Anders\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hanna\"],\"firstnames\":[\"Osama\",\"A\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Popovski\"],\"firstnames\":[\"Petar\"],\"suffixes\":[]}],\"journal\":\"arXiv e-prints\",\"pages\":\"arXiv–1803\",\"year\":\"2018\",\"bibtex\":\"@article{ellersgaard2018random,\\n  tags={osama},\\n  title={Random Access Schemes in Wireless Systems With Correlated User Activity},\\n  author={Ellersgaard Kal{\\\\o}r, Anders and Hanna, Osama A and Popovski, Petar},\\n  journal={arXiv e-prints},\\n  pages={arXiv--1803},\\n  year={2018}\\n}\\n\\n\",\"author_short\":[\"Ellersgaard Kalør, A.\",\"Hanna, O. A\",\"Popovski, P.\"],\"key\":\"ellersgaard2018random\",\"id\":\"ellersgaard2018random\",\"bibbaseid\":\"ellersgaardkalr-hanna-popovski-randomaccessschemesinwirelesssystemswithcorrelateduseractivity-2018\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"tags\":\"osama\",\"title\":\"Learning in distributed contextual linear bandits without sharing the context\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hanna\"],\"firstnames\":[\"Osama\",\"A\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Yang\"],\"firstnames\":[\"Lin\",\"F\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]}],\"journal\":\"arXiv preprint arXiv:2206.04180\",\"year\":\"2022\",\"bibtex\":\"@article{hanna2022learning,\\n  tags={osama},\\n  title={Learning in distributed contextual linear bandits without sharing the context},\\n  author={Hanna, Osama A and Yang, Lin F and Fragouli, Christina},\\n  journal={arXiv preprint arXiv:2206.04180},\\n  year={2022}\\n}\\n\\n\",\"author_short\":[\"Hanna, O. A\",\"Yang, L. F\",\"Fragouli, C.\"],\"key\":\"hanna2022learning\",\"id\":\"hanna2022learning\",\"bibbaseid\":\"hanna-yang-fragouli-learningindistributedcontextuallinearbanditswithoutsharingthecontext-2022\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"tags\":\"osama\",\"title\":\"Contexts can be cheap: Solving stochastic contextual bandits with linear bandit algorithms\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hanna\"],\"firstnames\":[\"Osama\",\"A\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Yang\"],\"firstnames\":[\"Lin\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]}],\"booktitle\":\"The Thirty Sixth Annual Conference on Learning Theory\",\"pages\":\"1791–1821\",\"year\":\"2023\",\"organization\":\"PMLR\",\"bibtex\":\"@inproceedings{hanna2023contexts,\\n  tags={osama},\\n  title={Contexts can be cheap: Solving stochastic contextual bandits with linear bandit algorithms},\\n  author={Hanna, Osama A and Yang, Lin and Fragouli, Christina},\\n  booktitle={The Thirty Sixth Annual Conference on Learning Theory},\\n  pages={1791--1821},\\n  year={2023},\\n  organization={PMLR}\\n}\\n\\n\",\"author_short\":[\"Hanna, O. A\",\"Yang, L.\",\"Fragouli, C.\"],\"key\":\"hanna2023contexts\",\"id\":\"hanna2023contexts\",\"bibbaseid\":\"hanna-yang-fragouli-contextscanbecheapsolvingstochasticcontextualbanditswithlinearbanditalgorithms-2023\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"tags\":\"osama\",\"title\":\"Learning from Distributed Users in Contextual Linear Bandits Without Sharing the Context\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hanna\"],\"firstnames\":[\"Osama\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Yang\"],\"firstnames\":[\"Lin\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]}],\"journal\":\"Advances in Neural Information Processing Systems\",\"volume\":\"35\",\"pages\":\"11049–11062\",\"year\":\"2022\",\"bibtex\":\"@article{hanna2022learning2,\\n  tags={osama},\\n  title={Learning from Distributed Users in Contextual Linear Bandits Without Sharing the Context},\\n  author={Hanna, Osama and Yang, Lin and Fragouli, Christina},\\n  journal={Advances in Neural Information Processing Systems},\\n  volume={35},\\n  pages={11049--11062},\\n  year={2022}\\n}\\n\\n\\n\",\"author_short\":[\"Hanna, O.\",\"Yang, L.\",\"Fragouli, C.\"],\"key\":\"hanna2022learning2\",\"id\":\"hanna2022learning2\",\"bibbaseid\":\"hanna-yang-fragouli-learningfromdistributedusersincontextuallinearbanditswithoutsharingthecontext-2022\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"tags\":\"osama\",\"title\":\"Differentially private stochastic linear bandits:(almost) for free\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hanna\"],\"firstnames\":[\"Osama\",\"A\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Girgis\"],\"firstnames\":[\"Antonious\",\"M\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]}],\"journal\":\"arXiv preprint arXiv:2207.03445\",\"year\":\"2022\",\"bibtex\":\"@article{hanna2022differentially,\\n  tags={osama},\\n  title={Differentially private stochastic linear bandits:(almost) for free},\\n  author={Hanna, Osama A and Girgis, Antonious M and Fragouli, Christina and Diggavi, Suhas},\\n  journal={arXiv preprint arXiv:2207.03445},\\n  year={2022}\\n}\\n\\n\\n\",\"author_short\":[\"Hanna, O. A\",\"Girgis, A. M\",\"Fragouli, C.\",\"Diggavi, S.\"],\"key\":\"hanna2022differentially\",\"id\":\"hanna2022differentially\",\"bibbaseid\":\"hanna-girgis-fragouli-diggavi-differentiallyprivatestochasticlinearbanditsalmostforfree-2022\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":11,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"tags\":\"merve,osama\",\"title\":\"Multi-Arm Bandits over Action Erasure Channels\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hanna\"],\"firstnames\":[\"Osama\",\"A\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Karakas\"],\"firstnames\":[\"Merve\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Yang\"],\"firstnames\":[\"Lin\",\"F\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]}],\"booktitle\":\"2023 IEEE International Symposium on Information Theory (ISIT)\",\"pages\":\"1312–1317\",\"year\":\"2023\",\"organization\":\"IEEE\",\"bibtex\":\"@inproceedings{hanna2023multi,\\n  type={4},\\n  tags={merve,osama},\\n  title={Multi-Arm Bandits over Action Erasure Channels},\\n  author={Hanna, Osama A and Karakas, Merve and Yang, Lin F and Fragouli, Christina},\\n  booktitle={2023 IEEE International Symposium on Information Theory (ISIT)},\\n  pages={1312--1317},\\n  year={2023},\\n  organization={IEEE}\\n}\\n\\n\",\"author_short\":[\"Hanna, O. A\",\"Karakas, M.\",\"Yang, L. F\",\"Fragouli, C.\"],\"key\":\"hanna2023multi\",\"id\":\"hanna2023multi\",\"bibbaseid\":\"hanna-karakas-yang-fragouli-multiarmbanditsoveractionerasurechannels-2023\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"tags\":\"osama\",\"title\":\"Efficient Batched Algorithms for Contextual Linear Bandits with Large Action Space via Soft Elimination\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hanna\"],\"firstnames\":[\"Osama\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Yang\"],\"firstnames\":[\"Lin\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]}],\"journal\":\"Advances in Neural Information Processing Systems\",\"volume\":\"\",\"pages\":\"\",\"year\":\"2023\",\"bibtex\":\"@article{hanna2023efficient,\\n  tags={osama},\\n  title={Efficient Batched Algorithms for Contextual Linear Bandits with Large Action Space via Soft Elimination},\\n  author={Hanna, Osama and Yang, Lin and Fragouli, Christina},\\n  journal={Advances in Neural Information Processing Systems},\\n  volume={},\\n  pages={},\\n  year={2023}\\n}\\n\\n\\n\\n% Updated by Xinlin @ 2022-Aug.\\n\\n\",\"author_short\":[\"Hanna, O.\",\"Yang, L.\",\"Fragouli, C.\"],\"key\":\"hanna2023efficient\",\"id\":\"hanna2023efficient\",\"bibbaseid\":\"hanna-yang-fragouli-efficientbatchedalgorithmsforcontextuallinearbanditswithlargeactionspaceviasoftelimination-2023\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"tags\":\"na,mine\",\"title\":\"Gomory-hu trees over wireless\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Dogan\"],\"firstnames\":[\"Mine\",\"Gokce\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Yahya\",\"H\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]}],\"journal\":\"IEEE Communications Letters\",\"volume\":\"26\",\"number\":\"5\",\"pages\":\"1004–1007\",\"year\":\"2022\",\"publisher\":\"IEEE\",\"bibtex\":\"@article{dogan2022gomory,\\n  type={2},\\n  tags={na,mine},\\n  title={Gomory-hu trees over wireless},\\n  author={Dogan, Mine Gokce and Ezzeldin, Yahya H and Fragouli, Christina},\\n  journal={IEEE Communications Letters},\\n  volume={26},\\n  number={5},\\n  pages={1004--1007},\\n  year={2022},\\n  publisher={IEEE}\\n}\\n\\n\\n\",\"author_short\":[\"Dogan, M. G.\",\"Ezzeldin, Y. H\",\"Fragouli, C.\"],\"key\":\"dogan2022gomory\",\"id\":\"dogan2022gomory\",\"bibbaseid\":\"dogan-ezzeldin-fragouli-gomoryhutreesoverwireless-2022\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"tags\":\"ML_CC,osama\",\"author\":[{\"firstnames\":[\"Osama\",\"A.\"],\"propositions\":[],\"lastnames\":[\"Hanna\"],\"suffixes\":[]},{\"firstnames\":[\"Lin\",\"F.\"],\"propositions\":[],\"lastnames\":[\"Yang\"],\"suffixes\":[]},{\"firstnames\":[\"Christina\"],\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"suffixes\":[]}],\"booktitle\":\"International Conference on Artificial Intelligence and Statistics\",\"title\":\"Solving Multi-Arm Bandit Using a Few Bits of Communication\",\"year\":\"2022\",\"pages\":\"3220-3225\",\"bibtex\":\"@INPROCEEDINGS{Hanna2022SolvingMB,\\n  type={4},\\n  tags={ML_CC,osama},\\n  author={Osama A. Hanna and Lin F. Yang and Christina Fragouli},\\n  booktitle={International Conference on Artificial Intelligence and Statistics}, \\n  title={Solving Multi-Arm Bandit Using a Few Bits of Communication},\\n  year={2022},\\n  pages={3220-3225}}\\n\\n\\n\",\"author_short\":[\"Hanna, O. A.\",\"Yang, L. F.\",\"Fragouli, C.\"],\"key\":\"Hanna2022SolvingMB\",\"id\":\"Hanna2022SolvingMB\",\"bibbaseid\":\"hanna-yang-fragouli-solvingmultiarmbanditusingafewbitsofcommunication-2022\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"tags\":\"group_testing,pavlos\",\"title\":\"Group testing for connected communities \",\"author\":[{\"propositions\":[],\"lastnames\":[\"Nikolopoulos\"],\"firstnames\":[\"Pavlos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Rajan\",\"Srinivasavaradhan\"],\"firstnames\":[\"Sundara\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Guo\"],\"firstnames\":[\"Tao\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of The 24th International Conference on Artificial Intelligence and Statistics\",\"pages\":\"2341–2349\",\"year\":\"2021\",\"editor\":[{\"propositions\":[],\"lastnames\":[\"Banerjee\"],\"firstnames\":[\"Arindam\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fukumizu\"],\"firstnames\":[\"Kenji\"],\"suffixes\":[]}],\"volume\":\"130\",\"series\":\"Proceedings of Machine Learning Research\",\"month\":\"13–15 Apr\",\"publisher\":\"PMLR\",\"pdf\":\"http://proceedings.mlr.press/v130/nikolopoulos21a/nikolopoulos21a.pdf\",\"url\":\"https://proceedings.mlr.press/v130/nikolopoulos21a.html\",\"bibtex\":\"@InProceedings{pmlr-v130-nikolopoulos21a,\\n  type={4},\\n  tags={group_testing,pavlos},\\n  title =  { Group testing for connected communities },\\n  author =  {Nikolopoulos, Pavlos and Rajan Srinivasavaradhan, Sundara and Guo, Tao and Fragouli, Christina and Diggavi, Suhas},\\n  booktitle =  {Proceedings of The 24th International Conference on Artificial Intelligence and Statistics},\\n  pages =  {2341--2349},\\n  year = {2021},\\n  editor = {Banerjee, Arindam and Fukumizu, Kenji},\\n  volume = {130},\\n  series = {Proceedings of Machine Learning Research},\\n  month =  {13--15 Apr},\\n  publisher =    {PMLR},\\n  pdf =    {http://proceedings.mlr.press/v130/nikolopoulos21a/nikolopoulos21a.pdf},\\n  url =    {https://proceedings.mlr.press/v130/nikolopoulos21a.html}\\n}\\n\\n\\n\",\"author_short\":[\"Nikolopoulos, P.\",\"Rajan Srinivasavaradhan, S.\",\"Guo, T.\",\"Fragouli, C.\",\"Diggavi, S.\"],\"editor_short\":[\"Banerjee, A.\",\"Fukumizu, K.\"],\"key\":\"pmlr-v130-nikolopoulos21a\",\"id\":\"pmlr-v130-nikolopoulos21a\",\"bibbaseid\":\"nikolopoulos-rajansrinivasavaradhan-guo-fragouli-diggavi-grouptestingforconnectedcommunities-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://proceedings.mlr.press/v130/nikolopoulos21a.html\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":5,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"tags\":\"ML_CC\",\"title\":\"On Coded Broadcasting for Wireless Recommendation Systems\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Vestergaard\"],\"firstnames\":[\"Rasmus\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hanna\"],\"firstnames\":[\"Osama\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Song\"],\"firstnames\":[\"Linqi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Lucani\"],\"firstnames\":[\"Daniel\",\"E\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]}],\"booktitle\":\"ICC 2021-IEEE International Conference on Communications\",\"pages\":\"1–6\",\"year\":\"2021\",\"organization\":\"IEEE\",\"bibtex\":\"@inproceedings{vestergaard2021coded,\\n  type={4},\\n  tags={osama},\\n  title={On Coded Broadcasting for Wireless Recommendation Systems},\\n  author={Vestergaard, Rasmus and Hanna, Osama and Song, Linqi and Lucani, Daniel E and Fragouli, Christina},\\n  booktitle={ICC 2021-IEEE International Conference on Communications},\\n  pages={1--6},\\n  year={2021},\\n  tags = {ML_CC},\\n  organization={IEEE}\\n}\\n\\n\\n\",\"author_short\":[\"Vestergaard, R.\",\"Hanna, O.\",\"Song, L.\",\"Lucani, D. E\",\"Fragouli, C.\"],\"key\":\"vestergaard2021coded-1\",\"id\":\"vestergaard2021coded-1\",\"bibbaseid\":\"vestergaard-hanna-song-lucani-fragouli-oncodedbroadcastingforwirelessrecommendationsystems-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"tags\":\"group_testing,pavlos\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Nikolopoulos\"],\"firstnames\":[\"Pavlos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Srinivasavaradhan\"],\"firstnames\":[\"Sundara\",\"Rajan\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Guo\"],\"firstnames\":[\"Tao\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Conference on Communications (ICC)\",\"title\":\"Group testing for overlapping communities\",\"month\":\"July\",\"year\":\"2021\",\"bibtex\":\"@inproceedings{nikolopoulos2020ICC,\\n  type={4},\\n  tags = {group_testing,pavlos},\\n  author = {Nikolopoulos, Pavlos and Srinivasavaradhan, Sundara Rajan and Guo, Tao and Fragouli, Christina and Diggavi, Suhas},\\n  booktitle = {{IEEE} {International} {Conference on} {Communications} ({ICC})},\\n  title = {Group testing for overlapping communities},\\n  month = July,\\n  year = {2021}\\n}\\n\\n\\n\",\"author_short\":[\"Nikolopoulos, P.\",\"Srinivasavaradhan, S. R.\",\"Guo, T.\",\"Fragouli, C.\",\"Diggavi, S.\"],\"key\":\"nikolopoulos2020ICC\",\"id\":\"nikolopoulos2020ICC\",\"bibbaseid\":\"nikolopoulos-srinivasavaradhan-guo-fragouli-diggavi-grouptestingforoverlappingcommunities-2021\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Agarwal\"],\"firstnames\":[\"G.\",\"K.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"tags\":\"security\",\"title\":\"On secure network coding for multiple unicast traffic\",\"year\":\"2020\",\"bibtex\":\"@article{agarwal_secure_2020,\\n type={2},\\n author = {Agarwal, G. K. and Cardone, M. and Fragouli, C.},\\n journal = {IEEE Transactions on Information Theory},\\n tags = {security},\\n title = {On secure network coding for multiple unicast traffic},\\n year = {2020}\\n}\\n\\n\",\"author_short\":[\"Agarwal, G. K.\",\"Cardone, M.\",\"Fragouli, C.\"],\"key\":\"agarwal_secure_2020\",\"id\":\"agarwal_secure_2020\",\"bibbaseid\":\"agarwal-cardone-fragouli-onsecurenetworkcodingformultipleunicasttraffic-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"1\",\"title\":\"Community aware group testing\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Nikolopoulos\"],\"firstnames\":[\"Pavlos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Guo\"],\"firstnames\":[\"Tao\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Srinivasavaradhan\"],\"firstnames\":[\"Sundara\",\"Rajan\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"Christina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]}],\"journal\":\"arXiv preprint arXiv:2007.08111\",\"tags\":\"group_testing\",\"month\":\"July\",\"year\":\"2020\",\"bibtex\":\"@article{nikolopoulos2020community,\\n  type={1},\\n  title={Community aware group testing},\\n  author={Nikolopoulos, Pavlos and Guo, Tao and Srinivasavaradhan, Sundara Rajan and Fragouli, Christina and Diggavi, Suhas},\\n  journal={arXiv preprint arXiv:2007.08111},\\n  tags = {group_testing},\\n  month = July,\\n  year={2020}\\n}\\n\\n% @article{nikolopoulos2020group,\\n%   type={1},\\n%   title={Group testing for overlapping communities},\\n%   author={Nikolopoulos, Pavlos and Srinivasavaradhan, Sundara Rajan and Guo, Tao and Fragouli, Christina and Diggavi, Suhas},\\n%   journal={arXiv preprint arXiv:2012.02804},\\n%   tags = {group_testing},\\n%   month = dec,\\n%   year={2020}\\n% }\\n\\n\\n\",\"author_short\":[\"Nikolopoulos, P.\",\"Guo, T.\",\"Srinivasavaradhan, S. R.\",\"Fragouli, C.\",\"Diggavi, S.\"],\"key\":\"nikolopoulos2020community\",\"id\":\"nikolopoulos2020community\",\"bibbaseid\":\"nikolopoulos-guo-srinivasavaradhan-fragouli-diggavi-communityawaregrouptesting-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Rebanal\"],\"firstnames\":[\"J.\",\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Y.\",\"H.\"],\"suffixes\":[]},{\"firstnames\":[],\"propositions\":[],\"lastnames\":[\"\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tabuada\"],\"firstnames\":[\"P.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Globecom\",\"tags\":\"channel_coding\",\"title\":\"A coding approach to localization using landmarks\",\"year\":\"2020\",\"bibtex\":\"@inproceedings{rebanal_distorting_2020,\\n type={4},\\n author = {Rebanal, J. C. and Ezzeldin, Y. H. and and Fragouli, C. and Tabuada, P.},\\n booktitle = {{IEEE} Globecom},\\n tags = {channel_coding},\\n title = {A coding approach to localization using landmarks},\\n year = {2020}\\n}\\n\\n\\n\",\"author_short\":[\"Rebanal, J. C.\",\"Ezzeldin, Y. H.\",\"\",\"Fragouli, C.\",\"Tabuada, P.\"],\"key\":\"rebanal_distorting_2020\",\"id\":\"rebanal_distorting_2020\",\"bibbaseid\":\"rebanal-ezzeldin--fragouli-tabuada-acodingapproachtolocalizationusinglandmarks-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"tags\":\"ML_CC\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hanna\"],\"firstnames\":[\"O.\",\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Y.\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Sadjadpour\"],\"firstnames\":[\"T.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]}],\"journal\":\"IEEE Journal on Selected Areas in Information Theory\",\"title\":\"On Distributed Quantization for Classification\",\"year\":\"2020\",\"bibtex\":\"@article{hanna_distributed_2020,\\n type={2},\\n tags={osama},\\n author = {Hanna, O. A. and Ezzeldin, Y. H. and Sadjadpour, T. and Fragouli, C. and Diggavi, S.},\\n journal = {IEEE Journal on Selected Areas in Information Theory},\\n tags = {ML_CC},\\n title = {On Distributed Quantization for Classification},\\n year = {2020}\\n}\\n\\n\\n% @article{srinivasavaradhan2020algorithms,\\n%   type={1},\\n%   title={Algorithms for reconstruction over single and multiple deletion channels},\\n%   author={Srinivasavaradhan, SR and Du, Michelle and Diggavi, S. and Fragouli, C.},\\n%   journal={arXiv preprint arXiv:2005.14388},\\n%   tags = {bio,channel_coding},\\n%   year={2020}\\n% }\\n\\n\\n\",\"author_short\":[\"Hanna, O. A.\",\"Ezzeldin, Y. H.\",\"Sadjadpour, T.\",\"Fragouli, C.\",\"Diggavi, S.\"],\"key\":\"hanna_distributed_2020\",\"id\":\"hanna_distributed_2020\",\"bibbaseid\":\"hanna-ezzeldin-sadjadpour-fragouli-diggavi-ondistributedquantizationforclassification-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Song\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Shah\"],\"firstnames\":[\"D.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"tags\":\"ML_CC\",\"title\":\"Interactions Between Learning and Broadcasting in Wireless Recommendation Systems\",\"year\":\"2019\",\"bibtex\":\"@inproceedings{song_interactions_2019,\\n type={4},\\n author = {Song, L. and Fragouli, C. and Shah, D.},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n tags = {ML_CC},\\n title = {Interactions {Between} {Learning} and {Broadcasting} in {Wireless} {Recommendation} {Systems}},\\n year = {2019}\\n}\\n\\n\\n\",\"author_short\":[\"Song, L.\",\"Fragouli, C.\",\"Shah, D.\"],\"key\":\"song_interactions_2019\",\"id\":\"song_interactions_2019\",\"bibbaseid\":\"song-fragouli-shah-interactionsbetweenlearningandbroadcastinginwirelessrecommendationsystems-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Y.\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\",\"N.\"],\"suffixes\":[]}],\"journal\":\"IEEE International Symposium of Information Theory (ISIT)\",\"tags\":\"ML_CC\",\"title\":\"Quantizing Signals for Linear Classification\",\"year\":\"2019\",\"bibtex\":\"@article{ezzeldin_quantizing_2019,\\n type={4},\\n author = {Ezzeldin, Y. H. and Fragouli, C. and Diggavi, S. N.},\\n journal = {IEEE International Symposium of Information Theory (ISIT)},\\n tags = {ML_CC},\\n title = {Quantizing Signals for Linear Classification},\\n year = {2019}\\n}\\n\\n\\n\",\"author_short\":[\"Ezzeldin, Y. H.\",\"Fragouli, C.\",\"Diggavi, S. N.\"],\"key\":\"ezzeldin_quantizing_2019\",\"id\":\"ezzeldin_quantizing_2019\",\"bibbaseid\":\"ezzeldin-fragouli-diggavi-quantizingsignalsforlinearclassification-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Agarwal\"],\"firstnames\":[\"G.\",\"K.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Karmoose\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tabuada\"],\"firstnames\":[\"P.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Conference on Decision and Control (CDC)\",\"tags\":\"security\",\"title\":\"Distorting an Adversary's View in Cyber-Physical Systems\",\"year\":\"2018\",\"bibtex\":\"@inproceedings{agarwal_distorting_2018,\\n type={4},\\n author = {Agarwal, G. K. and Karmoose, M. and Diggavi, S. and Fragouli, C. and Tabuada, P.},\\n booktitle = {{IEEE} {Conference} on {Decision} and {Control} ({CDC})},\\n tags = {security},\\n title = {Distorting an {Adversary}'s {View} in {Cyber}-{Physical} {Systems}},\\n year = {2018}\\n}\\n\\n\\n\",\"author_short\":[\"Agarwal, G. K.\",\"Karmoose, M.\",\"Diggavi, S.\",\"Fragouli, C.\",\"Tabuada, P.\"],\"key\":\"agarwal_distorting_2018\",\"id\":\"agarwal_distorting_2018\",\"bibbaseid\":\"agarwal-karmoose-diggavi-fragouli-tabuada-distortinganadversarysviewincyberphysicalsystems-2018\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"In this paper, we address the following problem. Given a fixed total number of feedforward and feedback filter taps in a decision feedback equalizer, what is the optimum number of taps of each filter and what is the optimum delay setting? We propose a simple algorithm that reduces the solution search space from being two-dimensional to one-dimensional at a small performance loss. We demosntrate the application of our algorithm for indoor wireless channels.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Al-Dhahir\"],\"firstnames\":[\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"CISS 2002\",\"tags\":\"wireless\",\"title\":\"How to choose the number of taps in a DFE?\",\"year\":\"2002\",\"bibtex\":\"@article{al-dhahir_how_2002,\\n abstract = {In this paper, we address the following problem. Given a fixed total number of feedforward and feedback filter taps in a decision feedback equalizer, what is the optimum number of taps of each filter and what is the optimum delay setting? We propose a simple algorithm that reduces the solution search space from being two-dimensional to one-dimensional at a small performance loss. We demosntrate the application of our algorithm for indoor wireless channels.},\\n type={4},\\n author = {Al-Dhahir, N. and Fragouli, C.},\\n journal = {CISS 2002},\\n tags = {wireless},\\n title = {How to choose the number of taps in a {DFE}?},\\n year = {2002}\\n}\\n\\n\",\"author_short\":[\"Al-Dhahir, N.\",\"Fragouli, C.\"],\"key\":\"al-dhahir_how_2002\",\"id\":\"al-dhahir_how_2002\",\"bibbaseid\":\"aldhahir-fragouli-howtochoosethenumberoftapsinadfe-2002\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"Communication complexity of computing functions using unrestricted communication and one-round communication are compared. In the standard unrestricted communication each party could potentially communicate several times while in one-round communication each party is restricted to communicate at most once. Results on the ratio of these two complexities are provided for symmetric and asymmetric functions under different scenarios. These results are suitably illustrated with examples.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Dhulipala\"],\"firstnames\":[\"Anand\",\"K.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Orlitsky\"],\"firstnames\":[\"Alon\"],\"suffixes\":[]}],\"booktitle\":\"Information Theory, 2007. ISIT 2007. IEEE International Symposium on\",\"doi\":\"10.1109/isit.2007.4557296\",\"month\":\"June\",\"pages\":\"636 –640\",\"tags\":\"CC\",\"title\":\"Single versus multiple rounds for distributed function computation\",\"year\":\"2007\",\"bibtex\":\"@inproceedings{dhulipala_single_2007,\\n abstract = {Communication complexity of computing functions using unrestricted communication and one-round communication are compared. In the standard unrestricted communication each party could potentially communicate several times while in one-round communication each party is restricted to communicate at most once. Results on the ratio of these two complexities are provided for symmetric and asymmetric functions under different scenarios. These results are suitably illustrated with examples.},\\n type={4},\\n author = {Dhulipala, Anand K. and Fragouli, C. and Orlitsky, Alon},\\n booktitle = {Information {Theory}, 2007. {ISIT} 2007. {IEEE} {International} {Symposium} on},\\n doi = {10.1109/isit.2007.4557296},\\n month = {June},\\n pages = {636 --640},\\n tags = {CC},\\n title = {Single versus multiple rounds for distributed function computation},\\n year = {2007}\\n}\\n\\n\",\"author_short\":[\"Dhulipala, A. K.\",\"Fragouli, C.\",\"Orlitsky, A.\"],\"key\":\"dhulipala_single_2007\",\"id\":\"dhulipala_single_2007\",\"bibbaseid\":\"dhulipala-fragouli-orlitsky-singleversusmultipleroundsfordistributedfunctioncomputation-2007\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Y.\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Karmoose\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Information Theory Workshop (ITW)\",\"tags\":\"ML_CC\",\"title\":\"Communication vs Distributed Computation: an alternative trade-off curve\",\"year\":\"2017\",\"bibtex\":\"@inproceedings{ezzeldin_communication_2017,\\n type={4},\\n author = {Ezzeldin, Y. H. and Karmoose, M. and Fragouli, C.},\\n booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},\\n tags = {ML_CC},\\n title = {Communication vs Distributed Computation: an alternative trade-off curve},\\n year = {2017}\\n}\\n\\n\\n\",\"author_short\":[\"Ezzeldin, Y. H.\",\"Karmoose, M.\",\"Fragouli, C.\"],\"key\":\"ezzeldin_communication_2017\",\"id\":\"ezzeldin_communication_2017\",\"bibbaseid\":\"ezzeldin-karmoose-fragouli-communicationvsdistributedcomputationanalternativetradeoffcurve-2017\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Gatzianas\"],\"firstnames\":[\"Marios\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Saeedi\"],\"firstnames\":[\"Shirin\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings NETCOD\",\"month\":\"June\",\"tags\":\"wireless,network_coding\",\"title\":\"Feedback-based coding algorithms for broadcast erasure channels with degraded message sets\",\"year\":\"2012\",\"bibtex\":\"@inproceedings{gatzianas_feedback-based_2012,\\n type={4},\\n author = {Gatzianas, Marios and Saeedi, Shirin and Fragouli, C.},\\n booktitle = {Proceedings {NETCOD}},\\n month = {June},\\n tags = {wireless,network_coding},\\n title = {Feedback-based coding algorithms for broadcast erasure channels with degraded message sets},\\n year = {2012}\\n}\\n\\n\\n\",\"author_short\":[\"Gatzianas, M.\",\"Saeedi, S.\",\"Fragouli, C.\"],\"key\":\"gatzianas_feedback-based_2012\",\"id\":\"gatzianas_feedback-based_2012\",\"bibbaseid\":\"gatzianas-saeedi-fragouli-feedbackbasedcodingalgorithmsforbroadcasterasurechannelswithdegradedmessagesets-2012\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Karamchandani\"],\"firstnames\":[\"Nikhil\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Keller\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Franceschetti\"],\"firstnames\":[\"Massimo\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"doi\":\"10.1109/isit.2010.5513755\",\"tags\":\"wireless,network_coding\",\"title\":\"Function computation via subspace coding\",\"year\":\"2010\",\"bibtex\":\"@inproceedings{karamchandani_function_2010,\\n abstract = {This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.},\\n type={4},\\n author = {Karamchandani, Nikhil and Keller, L. and Fragouli, C. and Franceschetti, Massimo},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n doi = {10.1109/isit.2010.5513755},\\n tags = {wireless,network_coding},\\n title = {Function computation via subspace coding},\\n year = {2010}\\n}\\n\\n\",\"author_short\":[\"Karamchandani, N.\",\"Keller, L.\",\"Fragouli, C.\",\"Franceschetti, M.\"],\"key\":\"karamchandani_function_2010\",\"id\":\"karamchandani_function_2010\",\"bibbaseid\":\"karamchandani-keller-fragouli-franceschetti-functioncomputationviasubspacecoding-2010\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Keller\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Karamchandani\"],\"firstnames\":[\"Nikhil\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Network Coding (NetCod)\",\"doi\":\"10.1109/NETCOD.2010.5487679\",\"tags\":\"wireless,network_coding\",\"title\":\"Function computation over linear channels\",\"year\":\"2010\",\"bibtex\":\"@inproceedings{keller_function_2010,\\n abstract = {This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.},\\n type={4},\\n author = {Keller, L. and Karamchandani, Nikhil and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} on {Network} {Coding} ({NetCod})},\\n doi = {10.1109/NETCOD.2010.5487679},\\n tags = {wireless,network_coding},\\n title = {Function computation over linear channels},\\n year = {2010}\\n}\\n\\n\",\"author_short\":[\"Keller, L.\",\"Karamchandani, N.\",\"Fragouli, C.\"],\"key\":\"keller_function_2010\",\"id\":\"keller_function_2010\",\"bibbaseid\":\"keller-karamchandani-fragouli-functioncomputationoverlinearchannels-2010\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"This paper experimentally studies the reliability and delay of flooding based multicast protocols for a sniper detection application. In particular using an emulator it studies under which conditions protocols based on network coding deliver performance improvements compared to classic flooding. It then presents an implementation of such protocols on mobile phones.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Keller\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Karaagac\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Argyraki\"],\"firstnames\":[\"K.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Wireless Measurements Workshop (WinMee)\",\"month\":\"May\",\"tags\":\"wireless, network_coding\",\"title\":\"A network coding approach to the sniper detection problem\",\"year\":\"2011\",\"bibtex\":\"@inproceedings{keller_network_2011,\\n abstract = {This paper experimentally studies the reliability and delay of flooding based multicast protocols for a sniper detection application. In particular using an emulator it studies under which conditions protocols based on network coding deliver performance improvements compared to classic flooding. It then presents an implementation of such protocols on mobile phones.},\\n type={4},\\n author = {Keller, L. and Karaagac, A. and Fragouli, C. and Argyraki, K.},\\n booktitle = {{IEEE} {Wireless} {Measurements} {Workshop} ({WinMee})},\\n month = {May},\\n tags = {wireless, network_coding},\\n title = {A network coding approach to the sniper detection problem},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Keller, L.\",\"Karaagac, A.\",\"Fragouli, C.\",\"Argyraki, K.\"],\"key\":\"keller_network_2011\",\"id\":\"keller_network_2011\",\"bibbaseid\":\"keller-karaagac-fragouli-argyraki-anetworkcodingapproachtothesniperdetectionproblem-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Saeedi\"],\"firstnames\":[\"Shirin\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"month\":\"August\",\"tags\":\"channel_coding,network_coding\",\"title\":\"Degraded two-message multicast over graphs\",\"year\":\"2011\",\"bibtex\":\"@inproceedings{saeedi_degraded_2011,\\n type={4},\\n author = {Saeedi, Shirin and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n month = {August},\\n tags = {channel_coding,network_coding},\\n title = {Degraded two-message multicast over graphs},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Saeedi, S.\",\"Fragouli, C.\"],\"key\":\"saeedi_degraded_2011\",\"id\":\"saeedi_degraded_2011\",\"bibbaseid\":\"saeedi-fragouli-degradedtwomessagemulticastovergraphs-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"Video applications are increasingly popular over smartphones. However, in current cellular systems, the downlink data rate fluctuates and the loss rate can be quite high. We are interested in the scenario where a group of smartphone users, within proximity of each other, are interested in viewing the same video at the same time and are also willing to cooperate with each other. We propose a system that maximizes the video quality by appropriately using all available resources, namely the cellular connections to the phones as well as the device-to-device links that can be established via Bluetooth or WiFi. Key ingredients of our design are: (i) the cooperation among users, (ii) network coding, and (iii) exploiting broadcast in the mobile-to-mobile links. Our approach is grounded on a network utility maximization formulation of the problem. We present numerical results that demonstrate the benefit of our approach, and we implement a prototype on android phones.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Seferoglu\"],\"firstnames\":[\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Keller\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Markopoulou\"],\"firstnames\":[\"Athina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Allerton Conference on Communications, Control and Computing\",\"tags\":\"wireless,network_coding\",\"title\":\"SmartCast: Cooperative video streaming on smartphones\",\"year\":\"2011\",\"bibtex\":\"@inproceedings{seferoglu_smartcast_2011,\\n abstract = {Video applications are increasingly popular over smartphones. However, in current cellular systems, the downlink data rate fluctuates and the loss rate can be quite high. We are interested in the scenario where a group of smartphone users, within proximity of each other, are interested in viewing the same video at the same time and are also willing to cooperate with each other. We propose a system that maximizes the video quality by appropriately using all available resources, namely the cellular connections to the phones as well as the device-to-device links that can be established via Bluetooth or WiFi. Key ingredients of our design are: (i) the cooperation among users, (ii) network coding, and (iii) exploiting broadcast in the mobile-to-mobile links. Our approach is grounded on a network utility maximization formulation of the problem. We present numerical results that demonstrate the benefit of our approach, and we implement a prototype on android phones.},\\n type={4},\\n author = {Seferoglu, H. and Keller, L. and Markopoulou, Athina and Fragouli, C.},\\n booktitle = {{IEEE} {Allerton} {Conference} on {Communications}, {Control} and {Computing}},\\n tags = {wireless,network_coding},\\n title = {{SmartCast}: {Cooperative} video streaming on smartphones},\\n year = {2011}\\n}\\n\\n\\n\",\"author_short\":[\"Seferoglu, H.\",\"Keller, L.\",\"Markopoulou, A.\",\"Fragouli, C.\"],\"key\":\"seferoglu_smartcast_2011\",\"id\":\"seferoglu_smartcast_2011\",\"bibbaseid\":\"seferoglu-keller-markopoulou-fragouli-smartcastcooperativevideostreamingonsmartphones-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Srinivasavaradhan\"],\"firstnames\":[\"SR\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Song\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium of Information Theory (ISIT)\",\"tags\":\"ML_CC\",\"title\":\"Distributed Computing Trade-offs with Random Connectivity\",\"year\":\"2018\",\"bibtex\":\"@inproceedings{srinivasavaradhan_distributed_2018,\\n type={4},\\n author = {Srinivasavaradhan, SR and Song, L. and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} of {Information} {Theory} ({ISIT})},\\n tags = {ML_CC},\\n title = {Distributed Computing Trade-offs with Random Connectivity},\\n year = {2018}\\n}\\n\\n\\n\",\"author_short\":[\"Srinivasavaradhan, S.\",\"Song, L.\",\"Fragouli, C.\"],\"key\":\"srinivasavaradhan_distributed_2018\",\"id\":\"srinivasavaradhan_distributed_2018\",\"bibbaseid\":\"srinivasavaradhan-song-fragouli-distributedcomputingtradeoffswithrandomconnectivity-2018\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Srinivasavaradhan\"],\"firstnames\":[\"SR\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Du\"],\"firstnames\":[\"Michelle\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium of Information Theory (ISIT)\",\"tags\":\"bio\",\"title\":\"On Maximum Likelihood Reconstruction over Multiple Deletion Channels\",\"year\":\"2018\",\"bibtex\":\"@inproceedings{srinivasavaradhan_maximum_2018,\\n type={4},\\n author = {Srinivasavaradhan, SR and Du, Michelle and Diggavi, S. and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} of {Information} {Theory} ({ISIT})},\\n tags = {bio},\\n title = {On Maximum Likelihood Reconstruction over Multiple Deletion Channels},\\n year = {2018}\\n}\\n\\n\\n\",\"author_short\":[\"Srinivasavaradhan, S.\",\"Du, M.\",\"Diggavi, S.\",\"Fragouli, C.\"],\"key\":\"srinivasavaradhan_maximum_2018\",\"id\":\"srinivasavaradhan_maximum_2018\",\"bibbaseid\":\"srinivasavaradhan-du-diggavi-fragouli-onmaximumlikelihoodreconstructionovermultipledeletionchannels-2018\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Venkatesan\"],\"firstnames\":[\"Vinodh\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Iliadis\"],\"firstnames\":[\"Ilias\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hu\"],\"firstnames\":[\"Xiao-Yu\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Haas\"],\"firstnames\":[\"Robert\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"Modeling, Analysis, and Simulation of Computer Systems, International Symposium on\",\"pages\":\"79–88\",\"tags\":\"storage\",\"title\":\"Effect of Replica Placement on the Reliability of Large-Scale Data Storage Systems\",\"volume\":\"0\",\"year\":\"2010\",\"bibtex\":\"@article{venkatesan_effect_2010,\\n type={4},\\n author = {Venkatesan, Vinodh and Iliadis, Ilias and Hu, Xiao-Yu and Haas, Robert and Fragouli, C.},\\n journal = {Modeling, Analysis, and Simulation of Computer Systems, International Symposium on},\\n pages = {79--88},\\n tags = {storage},\\n title = {Effect of {Replica} {Placement} on the {Reliability} of {Large}-{Scale} {Data} {Storage} {Systems}},\\n volume = {0},\\n year = {2010}\\n}\\n\\n\",\"author_short\":[\"Venkatesan, V.\",\"Iliadis, I.\",\"Hu, X.\",\"Haas, R.\",\"Fragouli, C.\"],\"key\":\"venkatesan_effect_2010\",\"id\":\"venkatesan_effect_2010\",\"bibbaseid\":\"venkatesan-iliadis-hu-haas-fragouli-effectofreplicaplacementonthereliabilityoflargescaledatastoragesystems-2010\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Venkatesan\"],\"firstnames\":[\"Vinodh\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Iliadis\"],\"firstnames\":[\"Ilias\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Urbanke\"],\"firstnames\":[\"R.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)\",\"month\":\"August\",\"tags\":\"storage\",\"title\":\"Reliability of clustered vs. declustered replica placement in data storage systems\",\"year\":\"2011\",\"bibtex\":\"@inproceedings{venkatesan_reliability_2011,\\n type={4},\\n author = {Venkatesan, Vinodh and Iliadis, Ilias and Fragouli, C. and Urbanke, R.},\\n booktitle = {{IEEE} {International} {Symposium} on {Modeling}, {Analysis} and {Simulation} of {Computer} and {Telecommunication} {Systems} ({MASCOTS})},\\n month = {August},\\n tags = {storage},\\n title = {Reliability of clustered vs. declustered replica placement in data storage systems},\\n year = {2011}\\n}\\n\\n\\n\\n\\n\",\"author_short\":[\"Venkatesan, V.\",\"Iliadis, I.\",\"Fragouli, C.\",\"Urbanke, R.\"],\"key\":\"venkatesan_reliability_2011\",\"id\":\"venkatesan_reliability_2011\",\"bibbaseid\":\"venkatesan-iliadis-fragouli-urbanke-reliabilityofclusteredvsdeclusteredreplicaplacementindatastoragesystems-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Agarwal\"],\"firstnames\":[\"G.\",\"K.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Karmoose\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tabuada\"],\"firstnames\":[\"P.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Automatic Control\",\"tags\":\"security\",\"title\":\"Distortion based Light-weight Security for Cyber-Physical Systems\",\"year\":\"2020\",\"bibtex\":\"@article{agarwal_distortion_2020,\\n type={2},\\n author = {Agarwal, G. K. and Karmoose, M. and Diggavi, S. and Fragouli, C. and Tabuada, P.},\\n journal = {IEEE Transactions on Automatic Control},\\n tags = {security},\\n title = {Distortion based {Light}-weight {Security} for {Cyber}-{Physical} {Systems}},\\n year = {2020}\\n}\\n\\n\",\"author_short\":[\"Agarwal, G. K.\",\"Karmoose, M.\",\"Diggavi, S.\",\"Fragouli, C.\",\"Tabuada, P.\"],\"key\":\"agarwal_distortion_2020\",\"id\":\"agarwal_distortion_2020\",\"bibbaseid\":\"agarwal-karmoose-diggavi-fragouli-tabuada-distortionbasedlightweightsecurityforcyberphysicalsystems-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Agarwal\"],\"firstnames\":[\"G.\",\"K.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"tags\":\"security\",\"title\":\"On Secure Network Coding for Two Unicast Sessions\",\"year\":\"2016\",\"bibtex\":\"@inproceedings{agarwal_secure_2016,\\n type={4},\\n author = {Agarwal, G. K. and Cardone, M. and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n tags = {security},\\n title = {On {Secure} {Network} {Coding} for {Two} {Unicast} {Sessions}},\\n year = {2016}\\n}\\n\\n\",\"author_short\":[\"Agarwal, G. K.\",\"Cardone, M.\",\"Fragouli, C.\"],\"key\":\"agarwal_secure_2016\",\"id\":\"agarwal_secure_2016\",\"bibbaseid\":\"agarwal-cardone-fragouli-onsecurenetworkcodingfortwounicastsessions-2016\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Agarwal\"],\"firstnames\":[\"G.\",\"K.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Symposium on Network Coding (NetCod)\",\"tags\":\"security\",\"title\":\"On secure network coding for two unicast sessions: studying butterflies\",\"year\":\"2016\",\"bibtex\":\"@inproceedings{agarwal_secure_2016-1,\\n type={4},\\n author = {Agarwal, G. K. and Cardone, M. and Fragouli, C.},\\n booktitle = {{IEEE} {Symposium} on {Network} {Coding} ({NetCod})},\\n tags = {security},\\n title = {On secure network coding for two unicast sessions: studying butterflies},\\n year = {2016}\\n}\\n\\n\",\"author_short\":[\"Agarwal, G. K.\",\"Cardone, M.\",\"Fragouli, C.\"],\"key\":\"agarwal_secure_2016-1\",\"id\":\"agarwal_secure_2016-1\",\"bibbaseid\":\"agarwal-cardone-fragouli-onsecurenetworkcodingfortwounicastsessionsstudyingbutterflies-2016\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Agarwal\"],\"firstnames\":[\"G.\",\"K.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"International Conference on Information Theoretic Security (ICITS)\",\"tags\":\"security\",\"title\":\"Secure Network Coding for Multiple Unicast: On the Case of Single Source\",\"year\":\"2017\",\"bibtex\":\"@inproceedings{agarwal_secure_2017,\\n type={4},\\n author = {Agarwal, G. K. and Cardone, M. and Fragouli, C.},\\n booktitle = {International {Conference} on {Information} {Theoretic} {Security} ({ICITS})},\\n tags = {security},\\n title = {Secure {Network} {Coding} for {Multiple} {Unicast}: {On} the {Case} of {Single} {Source}},\\n year = {2017}\\n}\\n\\n\",\"author_short\":[\"Agarwal, G. K.\",\"Cardone, M.\",\"Fragouli, C.\"],\"key\":\"agarwal_secure_2017\",\"id\":\"agarwal_secure_2017\",\"bibbaseid\":\"agarwal-cardone-fragouli-securenetworkcodingformultipleunicastonthecaseofsinglesource-2017\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Agarwal\"],\"firstnames\":[\"G.\",\"K.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Y.\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium of Information Theory (ISIT)\",\"tags\":\"security\",\"title\":\"Secure Communication over 1-2-1 Networks\",\"year\":\"2018\",\"bibtex\":\"@inproceedings{agarwal_secure_2018,\\n type={4},\\n author = {Agarwal, G. K. and Ezzeldin, Y. H. and Cardone, M. and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} of {Information} {Theory} ({ISIT})},\\n tags = {security},\\n title = {Secure {Communication} over 1-2-1 {Networks}},\\n year = {2018}\\n}\\n\\n\",\"author_short\":[\"Agarwal, G. K.\",\"Ezzeldin, Y. H.\",\"Cardone, M.\",\"Fragouli, C.\"],\"key\":\"agarwal_secure_2018\",\"id\":\"agarwal_secure_2018\",\"bibbaseid\":\"agarwal-ezzeldin-cardone-fragouli-securecommunicationover121networks-2018\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Agarwal\"],\"firstnames\":[\"G.\",\"K.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Workshop on Information Theory (ITW)\",\"tags\":\"security\",\"title\":\"On Secure Capacity of Multiple Unicast Traffic over Separable Networks\",\"year\":\"2019\",\"bibtex\":\"@inproceedings{agarwal_secure_2019,\\n type={4},\\n author = {Agarwal, G. K. and Cardone, M. and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Workshop} on {Information} {Theory} ({ITW})},\\n tags = {security},\\n title = {On {Secure} {Capacity} of {Multiple} {Unicast} {Traffic} over {Separable} {Networks}},\\n year = {2019}\\n}\\n\\n\\n\",\"author_short\":[\"Agarwal, G. K.\",\"Cardone, M.\",\"Fragouli, C.\"],\"key\":\"agarwal_secure_2019\",\"id\":\"agarwal_secure_2019\",\"bibbaseid\":\"agarwal-cardone-fragouli-onsecurecapacityofmultipleunicasttrafficoverseparablenetworks-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"In this paper, we address the following problem. Given a fixed total number of feedforward and feedback filter taps in a decision feedback equalizer, what is the optimum number of taps of each filter and what is the optimum delay setting? We propose a simple algorithm that resudes the solution search space from being two-dimensional to one-dimensional at a small performance loss. We demosntrate the application of our algorithm for indoor wireless channels.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Al-Dhahir\"],\"firstnames\":[\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"CISS 2002\",\"tags\":\"wireless\",\"title\":\"How to choose the number of taps in a DFE?\",\"year\":\"2002\",\"bibtex\":\"@article{al-dhahir_how_2002,\\n abstract = {In this paper, we address the following problem. Given a fixed total number of feedforward and feedback filter taps in a decision feedback equalizer, what is the optimum number of taps of each filter and what is the optimum delay setting? We propose a simple algorithm that resudes the solution search space from being two-dimensional to one-dimensional at a small performance loss. We demosntrate the application of our algorithm for indoor wireless channels.},\\n type={4},\\n author = {Al-Dhahir, N. and Fragouli, C.},\\n journal = {CISS 2002},\\n tags = {wireless},\\n title = {How to choose the number of taps in a {DFE}?},\\n year = {2002}\\n}\\n\\n\",\"author_short\":[\"Al-Dhahir, N.\",\"Fragouli, C.\"],\"key\":\"al-dhahir_how_2002-1\",\"id\":\"al-dhahir_how_2002-1\",\"bibbaseid\":\"aldhahir-fragouli-howtochoosethenumberoftapsinadfe-2002\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"We present an overview of research activities on space-time coding for broadband wireless transmission performed at AT&amp;T Shannon Laboratory over the past two years. The emphasis is on physical layer modem algorithms such as channel estimation, equalization, and interference cancellation. However, we also discuss the impact of space-time coding gains at the physical layer on throughput at or above the networking layer. Furthermore, we describe a flexible graphical user interface attached to our physical layer simulation engine in order to explore the performance of space-time codes under a variety of practical transmission scenarios. Simulation results for the EDGE cellular system and the 802.11 wireless LAN environment are presented.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Al-Dhahir\"],\"firstnames\":[\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Stamoulis\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Younis\"],\"firstnames\":[\"W.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Calderbank\"],\"firstnames\":[\"A.\",\"R.\"],\"suffixes\":[]}],\"journal\":\"IEEE Communications Magazine issue “Technologies for 3G and Beyond”\",\"pages\":\"pages 136–142\",\"tags\":\"wireless,channel_coding\",\"title\":\"Space-Time Coding for Broadband Wireless Transmission\",\"volume\":\"vol. 40, no. 9\",\"year\":\"2002\",\"bibtex\":\"@article{al-dhahir_space-time_2002,\\n abstract = {We present an overview of research activities on space-time coding for broadband wireless transmission performed at AT\\\\&amp;T Shannon Laboratory over the past two years. The emphasis is on physical layer modem algorithms such as channel estimation, equalization, and interference cancellation. However, we also discuss the impact of space-time coding gains at the physical layer on throughput at or above the networking layer. Furthermore, we describe a flexible graphical user interface attached to our physical layer simulation engine in order to explore the performance of space-time codes under a variety of practical transmission scenarios. Simulation results for the EDGE cellular system and the 802.11 wireless LAN environment are presented.},\\n type={4},\\n author = {Al-Dhahir, N. and Fragouli, C. and Stamoulis, A. and Younis, W. and Calderbank, A. R.},\\n journal = {IEEE Communications Magazine issue “Technologies for 3G and Beyond”},\\n pages = {pages 136--142},\\n tags = {wireless,channel_coding},\\n title = {Space-{Time} {Coding} for {Broadband} {Wireless} {Transmission}},\\n volume = {vol. 40, no. 9},\\n year = {2002}\\n}\\n\\n\",\"author_short\":[\"Al-Dhahir, N.\",\"Fragouli, C.\",\"Stamoulis, A.\",\"Younis, W.\",\"Calderbank, A. R.\"],\"key\":\"al-dhahir_space-time_2002\",\"id\":\"al-dhahir_space-time_2002\",\"bibbaseid\":\"aldhahir-fragouli-stamoulis-younis-calderbank-spacetimecodingforbroadbandwirelesstransmission-2002\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"A long-standing open question in information theory is to characterize the unicast capacity of a wireless relay network. The difficulty arises due to the complex signal interactions induced in the network, since the wireless channel inherently broadcasts the signals and there is interference among transmissions. Recently, Avestimehr, Diggavi and Tse proposed a linear binary deterministic model that takes into account the shared nature of wireless channels, focusing on the signal interactions rather than the background noise. They generalized the min-cut max-flow theorem for graphs to networks of deterministic channels and proved that the capacity can be achieved using information theoretical tools. They showed that the value of the minimum cut is in this case the minimum rank of all the binary adjacency matrices describing source-destination cuts. However, since there exists an exponential number of cuts, identifying the capacity through exhaustive search becomes infeasible. In this work, we develop a polynomial time algorithm that discovers the relay encoding strategy to achieve the min-cut value in binary linear deterministic (wireless) networks, for the case of a unicast connection. Our algorithm crucially uses a notion of linear independence between edges to calculate the capacity in polynomial time. Moreover, we can achieve the capacity by using very simple one-bit processing at the intermediate nodes, thereby constructively yielding finite length strategies that achieve the unicast capacity of the linear deterministic (wireless) relay network.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Amaudruz\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"ACM-SIAM Symposium on Discrete Algorithms (SODA)\",\"tags\":\"wireless\",\"title\":\"Combinatorial algorithms for wireless information flow\",\"year\":\"2009\",\"bibtex\":\"@article{amaudruz_combinatorial_2009,\\n abstract = {A long-standing open question in information theory is to characterize the unicast capacity of a wireless relay network. The difficulty arises due to the complex signal interactions induced in the network, since the wireless channel inherently broadcasts the signals and there is interference among transmissions. Recently, Avestimehr, Diggavi and Tse proposed a linear binary deterministic model that takes into account the shared nature of wireless channels, focusing on the signal interactions rather than the background noise. They generalized the min-cut max-flow theorem for graphs to networks of deterministic channels and proved that the capacity can be achieved using information theoretical tools. They showed that the value of the minimum cut is in this case the minimum rank of all the binary adjacency matrices describing source-destination cuts. However, since there exists an exponential number of cuts, identifying the capacity through exhaustive search becomes infeasible. In this work, we develop a polynomial time algorithm that discovers the relay encoding strategy to achieve the min-cut value in binary linear deterministic (wireless) networks, for the case of a unicast connection. Our algorithm crucially uses a notion of linear independence between edges to calculate the capacity in polynomial time. Moreover, we can achieve the capacity by using very simple one-bit processing at the intermediate nodes, thereby constructively yielding finite length strategies that achieve the unicast capacity of the linear deterministic (wireless) relay network.},\\n type={4},\\n author = {Amaudruz, A. and Fragouli, C.},\\n journal = {ACM-SIAM Symposium on Discrete Algorithms (SODA)},\\n tags = {wireless},\\n title = {Combinatorial algorithms for wireless information flow},\\n year = {2009}\\n}\\n\\n\",\"author_short\":[\"Amaudruz, A.\",\"Fragouli, C.\"],\"key\":\"amaudruz_combinatorial_2009\",\"id\":\"amaudruz_combinatorial_2009\",\"bibbaseid\":\"amaudruz-fragouli-combinatorialalgorithmsforwirelessinformationflow-2009\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"We consider a unicast communication problem where a source transmits information to a destination through a wireless network with the help of k relays positioned on a line. We adopt the linear deterministic model to capture the wireless signal interactions and study the optimal placement of the relays so that the capacity from the source to the destination in the deterministic network is maximized. Analytical results are provided for a number of special cases, and the insights gained are used to provide a heuristic framework for designing large relay networks.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Appuswamy\"],\"firstnames\":[\"R.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Atsan\"],\"firstnames\":[\"Emre\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Franceschetti\"],\"firstnames\":[\"Massimo\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Wireless Network Coding Workshop (WiNC)\",\"tags\":\"wireless\",\"title\":\"On relay placement for deterministic line networks\",\"year\":\"2010\",\"bibtex\":\"@inproceedings{appuswamy_relay_2010,\\n abstract = {We consider a unicast communication problem where a source transmits information to a destination through a wireless network with the help of k relays positioned on a line. We adopt the linear deterministic model to capture the wireless signal interactions and study the optimal placement of the relays so that the capacity from the source to the destination in the deterministic network is maximized. Analytical results are provided for a number of special cases, and the insights gained are used to provide a heuristic framework for designing large relay networks.},\\n type={4},\\n author = {Appuswamy, R. and Atsan, Emre and Fragouli, C. and Franceschetti, Massimo},\\n booktitle = {{IEEE} {Wireless} {Network} {Coding} {Workshop} ({WiNC})},\\n tags = {wireless},\\n title = {On relay placement for deterministic line networks},\\n year = {2010}\\n}\\n\\n\",\"author_short\":[\"Appuswamy, R.\",\"Atsan, E.\",\"Fragouli, C.\",\"Franceschetti, M.\"],\"key\":\"appuswamy_relay_2010\",\"id\":\"appuswamy_relay_2010\",\"bibbaseid\":\"appuswamy-atsan-fragouli-franceschetti-onrelayplacementfordeterministiclinenetworks-2010\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"Current security systems often rely on the adversary's computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary's limited network presence (i.e., that the adversary cannot be located at many different points in the network at the same time). We present a system that leverages this opportunity to enable N wireless nodes to create a shared secret S, in a way that an eavesdropper, Eve, obtains very little information on S. Our system consists of two steps: (1) The nodes transmit packets following a special pattern, such that Eve learns very little about a given fraction of the transmitted packets. This is achieved through a combination of beam forming (from many different sources) and wiretap codes. (2) The nodes participate in a protocol that reshuffles the information known to each node, such that the nodes end up sharing a secret that Eve knows very little about. Our protocol is easily implementable in existing wireless devices and scales well with the number of nodes; these properties are achieved through a combination of public feedback, broadcasting, and network coding. We evaluate our system through a 5-node testbed. We demonstrate that a group of wireless nodes can generate thousands of new shared secret bits per second, with their secrecy being independent of the adversary's computational capabilities.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Argyraki\"],\"firstnames\":[\"K.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Duarte\",\"Gelvez\"],\"firstnames\":[\"Melissa\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Gkatzianas\"],\"firstnames\":[\"Marios\",\"Apostolos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Kostopoulos\"],\"firstnames\":[\"Panagiotis\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the ACM Conference on Mobile Computing and Networking (MobiCom)\",\"doi\":\"10.1145/2500423.2500440\",\"keywords\":\"Group secret agreement, Physical-layer security\",\"note\":\"event-place: Miami, Florida, USA\",\"tags\":\"security\",\"title\":\"Creating Secrets out of Erasures\",\"year\":\"2013\",\"bibtex\":\"@inproceedings{argyraki_creating_2013,\\n abstract = {Current security systems often rely on the adversary's computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary's limited network presence (i.e., that the adversary cannot be located at many different points in the network at the same time). We present a system that leverages this opportunity to enable N wireless nodes to create a shared secret S, in a way that an eavesdropper, Eve, obtains very little information on S. Our system consists of two steps: (1) The nodes transmit packets following a special pattern, such that Eve learns very little about a given fraction of the transmitted packets. This is achieved through a combination of beam forming (from many different sources) and wiretap codes. (2) The nodes participate in a protocol that reshuffles the information known to each node, such that the nodes end up sharing a secret that Eve knows very little about. Our protocol is easily implementable in existing wireless devices and scales well with the number of nodes; these properties are achieved through a combination of public feedback, broadcasting, and network coding. We evaluate our system through a 5-node testbed. We demonstrate that a group of wireless nodes can generate thousands of new shared secret bits per second, with their secrecy being independent of the adversary's computational capabilities.},\\n type={4},\\n author = {Argyraki, K. and Diggavi, Suhas and Duarte Gelvez, Melissa and Fragouli, C. and Gkatzianas, Marios Apostolos and Kostopoulos, Panagiotis},\\n booktitle = {Proceedings of the {ACM} {Conference} on {Mobile} {Computing} and {Networking} ({MobiCom})},\\n doi = {10.1145/2500423.2500440},\\n keywords = {Group secret agreement, Physical-layer security},\\n note = {event-place: Miami, Florida, USA},\\n tags = {security},\\n title = {Creating {Secrets} out of {Erasures}},\\n year = {2013}\\n}\\n\\n\",\"author_short\":[\"Argyraki, K.\",\"Diggavi, S.\",\"Duarte Gelvez, M.\",\"Fragouli, C.\",\"Gkatzianas, M. A.\",\"Kostopoulos, P.\"],\"key\":\"argyraki_creating_2013\",\"id\":\"argyraki_creating_2013\",\"bibbaseid\":\"argyraki-diggavi-duartegelvez-fragouli-gkatzianas-kostopoulos-creatingsecretsoutoferasures-2013\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Group secret agreement\",\"Physical-layer security\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"We design and evaluate a lightweight encryption protocol suitable for sensor networks, that enables weak security in the presence of passive eavesdroppers. At every communication round, our protocol creates a key between each sensor node and the sink, by appropriately mixing and coding information packets that the nodes passively overhear. Evaluation using the TOSSIM simulator indicates that with our protocol we can gain significant security benefits at low overhead cost.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Atsan\"],\"firstnames\":[\"Emre\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Safaka\"],\"firstnames\":[\"I.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Keller\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the 2013 IEEE International Symposium on Network Coding (NetCod)\",\"keywords\":\"information-theoretic security, Sensor networks, Week security\",\"note\":\"event-place: Calgary, Canada\",\"tags\":\"security,sensor_networks\",\"title\":\"Low cost security for sensor networks\",\"year\":\"2013\",\"bibtex\":\"@inproceedings{atsan_low_2013,\\n abstract = {We design and evaluate a lightweight encryption protocol suitable for sensor networks, that enables weak security in the presence of passive eavesdroppers. At every communication round, our protocol creates a key between each sensor node and the sink, by appropriately mixing and coding information packets that the nodes passively overhear. Evaluation using the TOSSIM simulator indicates that with our protocol we can gain significant security benefits at low overhead cost.},\\n type={4},\\n author = {Atsan, Emre and Safaka, I. and Keller, L. and Fragouli, C.},\\n booktitle = {Proceedings of the 2013 {IEEE} {International} {Symposium} on {Network} {Coding} ({NetCod})},\\n keywords = {information-theoretic security, Sensor networks, Week security},\\n note = {event-place: Calgary, Canada},\\n tags = {security,sensor_networks},\\n title = {Low cost security for sensor networks},\\n year = {2013}\\n}\\n\\n\",\"author_short\":[\"Atsan, E.\",\"Safaka, I.\",\"Keller, L.\",\"Fragouli, C.\"],\"key\":\"atsan_low_2013\",\"id\":\"atsan_low_2013\",\"bibbaseid\":\"atsan-safaka-keller-fragouli-lowcostsecurityforsensornetworks-2013\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"information-theoretic security\",\"Sensor networks\",\"Week security\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"We present a method to integrate the Quantize-Map-Forward (QMF) relaying scheme into the standard LTE operation, for a two-relay diamond network configuration. Our approach implements QMF using mainly existing LTE modules and functionalities, and results in minimal changes in the standard link-layer LTE operation. In particular, the destination operation is only affected in that we adapt the log-likelihood ratio (LLR) calculations at the decoder input to take into account the existence of relays; thus, the decoding complexity and operations (apart the LLR calculations) are not modified. We report extensive performance evaluations of our scheme using the OpenAirInterface (OAI) link-level simulation tools.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Atsan\"],\"firstnames\":[\"Emre\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Knopp\"],\"firstnames\":[\"Raymond\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"Information Theory Workshop (ITW)\",\"publisher\":\"IEEE\",\"tags\":\"wireless\",\"title\":\"Towards integrating Quantize-Map-Forward relaying into LTE\",\"year\":\"2012\",\"bibtex\":\"@inproceedings{atsan_towards_2012,\\n abstract = {We present a method to integrate the Quantize-Map-Forward (QMF) relaying scheme into the standard LTE operation, for a two-relay diamond network configuration. Our approach implements QMF using mainly existing LTE modules and functionalities, and results in minimal changes in the standard link-layer LTE operation. In particular, the destination operation is only affected in that we adapt the log-likelihood ratio (LLR) calculations at the decoder input to take into account the existence of relays; thus, the decoding complexity and operations (apart the LLR calculations) are not modified. We report extensive performance evaluations of our scheme using the OpenAirInterface (OAI) link-level simulation tools.},\\n type={4},\\n author = {Atsan, Emre and Knopp, Raymond and Diggavi, Suhas N. and Fragouli, C.},\\n booktitle = {Information {Theory} {Workshop} ({ITW})},\\n publisher = {IEEE},\\n tags = {wireless},\\n title = {Towards integrating {Quantize}-{Map}-{Forward} relaying into {LTE}},\\n year = {2012}\\n}\\n\\n\",\"author_short\":[\"Atsan, E.\",\"Knopp, R.\",\"Diggavi, S. N.\",\"Fragouli, C.\"],\"key\":\"atsan_towards_2012\",\"id\":\"atsan_towards_2012\",\"bibbaseid\":\"atsan-knopp-diggavi-fragouli-towardsintegratingquantizemapforwardrelayingintolte-2012\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Brahma\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ozgur\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"tags\":\"wireless\",\"title\":\"On the Complexity of Scheduling in Half-Duplex Diamond Networks\",\"year\":\"2016\",\"bibtex\":\"@article{brahma_complexity_2016,\\n type={2},\\n author = {Brahma, S. and Ozgur, A. and Fragouli, C.},\\n journal = {IEEE Transactions on Information Theory},\\n tags = {wireless},\\n title = {On the {Complexity} of {Scheduling} in {Half}-{Duplex} {Diamond} {Networks}},\\n year = {2016}\\n}\\n\\n\",\"author_short\":[\"Brahma, S.\",\"Ozgur, A.\",\"Fragouli, C.\"],\"key\":\"brahma_complexity_2016\",\"id\":\"brahma_complexity_2016\",\"bibbaseid\":\"brahma-ozgur-fragouli-onthecomplexityofschedulinginhalfduplexdiamondnetworks-2016\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Brahma\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on\",\"pages\":\"2251–2255\",\"publisher\":\"IEEE\",\"tags\":\"network_coding\",\"title\":\"Pliable index coding\",\"year\":\"2012\",\"bibtex\":\"@inproceedings{brahma_pliable_2012,\\n type={4},\\n author = {Brahma, S. and Fragouli, C.},\\n booktitle = {Information {Theory} {Proceedings} ({ISIT}), 2012 {IEEE} {International} {Symposium} on},\\n pages = {2251--2255},\\n publisher = {IEEE},\\n tags = {network_coding},\\n title = {Pliable index coding},\\n year = {2012}\\n}\\n\\n\",\"author_short\":[\"Brahma, S.\",\"Fragouli, C.\"],\"key\":\"brahma_pliable_2012\",\"id\":\"brahma_pliable_2012\",\"bibbaseid\":\"brahma-fragouli-pliableindexcoding-2012\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Brahma\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the IEEE International Symposium on Infromation Theory (ISIT)\",\"tags\":\"network_coding\",\"title\":\"Pliable Index Coding - The Multiple Requests Case\",\"year\":\"2013\",\"bibtex\":\"@inproceedings{brahma_pliable_2013,\\n type={4},\\n author = {Brahma, S. and Fragouli, C.},\\n booktitle = {Proceedings of the {IEEE} {International} {Symposium} on {Infromation} {Theory} ({ISIT})},\\n tags = {network_coding},\\n title = {Pliable {Index} {Coding} - {The} {Multiple} {Requests} {Case}},\\n year = {2013}\\n}\\n\\n\",\"author_short\":[\"Brahma, S.\",\"Fragouli, C.\"],\"key\":\"brahma_pliable_2013\",\"id\":\"brahma_pliable_2013\",\"bibbaseid\":\"brahma-fragouli-pliableindexcodingthemultiplerequestscase-2013\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Brahma\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"tags\":\"network_coding\",\"title\":\"Pliable Index Coding\",\"year\":\"2015\",\"bibtex\":\"@article{brahma_pliable_2015,\\n type={2},\\n author = {Brahma, S. and Fragouli, C.},\\n journal = {IEEE Transactions on Information Theory},\\n tags = {network_coding},\\n title = {Pliable {Index} {Coding}},\\n year = {2015}\\n}\\n\\n\",\"author_short\":[\"Brahma, S.\",\"Fragouli, C.\"],\"key\":\"brahma_pliable_2015\",\"id\":\"brahma_pliable_2015\",\"bibbaseid\":\"brahma-fragouli-pliableindexcoding-2015\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Brahma\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Sengupta\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Duarte\",\"Gelvez\"],\"firstnames\":[\"Melissa\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]}],\"booktitle\":\"IEEE INFOCOM\",\"tags\":\"wireless\",\"title\":\"QUILT: A decode/quantize-interleave-transmit approach to cooperative relaying\",\"year\":\"2014\",\"bibtex\":\"@inproceedings{brahma_quilt_2014,\\n type={4},\\n author = {Brahma, S. and Sengupta, A. and Duarte Gelvez, Melissa and Fragouli, C. and Diggavi, Suhas},\\n booktitle = {{IEEE} {INFOCOM}},\\n tags = {wireless},\\n title = {{QUILT}: {A} decode/quantize-interleave-transmit approach to cooperative relaying},\\n year = {2014}\\n}\\n\\n\",\"author_short\":[\"Brahma, S.\",\"Sengupta, A.\",\"Duarte Gelvez, M.\",\"Fragouli, C.\",\"Diggavi, S.\"],\"key\":\"brahma_quilt_2014\",\"id\":\"brahma_quilt_2014\",\"bibbaseid\":\"brahma-sengupta-duartegelvez-fragouli-diggavi-quiltadecodequantizeinterleavetransmitapproachtocooperativerelaying-2014\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Brahma\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ozgur\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on\",\"pages\":\"1112–1116\",\"publisher\":\"IEEE\",\"tags\":\"wireless\",\"title\":\"Simple schedules for half-duplex networks\",\"year\":\"2012\",\"bibtex\":\"@inproceedings{brahma_simple_2012,\\n type={4},\\n author = {Brahma, S. and Ozgur, A. and Fragouli, C.},\\n booktitle = {Information {Theory} {Proceedings} ({ISIT}), 2012 {IEEE} {International} {Symposium} on},\\n pages = {1112--1116},\\n publisher = {IEEE},\\n tags = {wireless},\\n title = {Simple schedules for half-duplex networks},\\n year = {2012}\\n}\\n\\n\",\"author_short\":[\"Brahma, S.\",\"Ozgur, A.\",\"Fragouli, C.\"],\"key\":\"brahma_simple_2012\",\"id\":\"brahma_simple_2012\",\"bibbaseid\":\"brahma-ozgur-fragouli-simpleschedulesforhalfduplexnetworks-2012\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Brahma\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"tags\":\"wireless\",\"title\":\"A simple relaying strategy for diamond networks\",\"year\":\"2014\",\"bibtex\":\"@inproceedings{brahma_simple_2014,\\n type={4},\\n author = {Brahma, S. and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n tags = {wireless},\\n title = {A simple relaying strategy for diamond networks},\\n year = {2014}\\n}\\n\\n\",\"author_short\":[\"Brahma, S.\",\"Fragouli, C.\"],\"key\":\"brahma_simple_2014\",\"id\":\"brahma_simple_2014\",\"bibbaseid\":\"brahma-fragouli-asimplerelayingstrategyfordiamondnetworks-2014\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Brahma\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ozgur\"],\"firstnames\":[\"A.\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the Annual Allerton Conference on Communication, Control, and Computing\",\"tags\":\"wireless\",\"title\":\"On the structure of approximately optimal schedules for half-duplex diamond networks\",\"year\":\"2013\",\"bibtex\":\"@inproceedings{brahma_structure_2013,\\n type={4},\\n author = {Brahma, S. and Fragouli, C. and Ozgur, A.},\\n booktitle = {Proceedings of the {Annual} {Allerton} {Conference} on {Communication}, {Control}, and {Computing}},\\n tags = {wireless},\\n title = {On the structure of approximately optimal schedules for half-duplex diamond networks},\\n year = {2013}\\n}\\n\\n\",\"author_short\":[\"Brahma, S.\",\"Fragouli, C.\",\"Ozgur, A.\"],\"key\":\"brahma_structure_2013\",\"id\":\"brahma_structure_2013\",\"bibbaseid\":\"brahma-fragouli-ozgur-onthestructureofapproximatelyoptimalschedulesforhalfduplexdiamondnetworks-2013\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Brahma\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"tags\":\"wireless\",\"title\":\"Structure of optimal schedules in diamond networks\",\"year\":\"2014\",\"bibtex\":\"@inproceedings{brahma_structure_2014,\\n type={4},\\n author = {Brahma, S. and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n tags = {wireless},\\n title = {Structure of optimal schedules in diamond networks},\\n year = {2014}\\n}\\n\\n\",\"author_short\":[\"Brahma, S.\",\"Fragouli, C.\"],\"key\":\"brahma_structure_2014\",\"id\":\"brahma_structure_2014\",\"bibbaseid\":\"brahma-fragouli-structureofoptimalschedulesindiamondnetworks-2014\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Brahma\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Sengupta\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Information Theory Workshop (ITW)\",\"tags\":\"wireless\",\"title\":\"Switched local schedules for diamond networks\",\"year\":\"2014\",\"bibtex\":\"@inproceedings{brahma_switched_2014,\\n type={4},\\n author = {Brahma, S. and Sengupta, A. and Fragouli, C.},\\n booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},\\n tags = {wireless},\\n title = {Switched local schedules for diamond networks},\\n year = {2014}\\n}\\n\\n\",\"author_short\":[\"Brahma, S.\",\"Sengupta, A.\",\"Fragouli, C.\"],\"key\":\"brahma_switched_2014\",\"id\":\"brahma_switched_2014\",\"bibbaseid\":\"brahma-sengupta-fragouli-switchedlocalschedulesfordiamondnetworks-2014\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Buyukalp\"],\"firstnames\":[\"Y.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Maatouk\"],\"firstnames\":[\"G.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"V.\",\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"Network Coding (NetCod), 2012 International Symposium on\",\"pages\":\"79–84\",\"publisher\":\"IEEE\",\"tags\":\"network_coding,security\",\"title\":\"Untrusting network coding\",\"year\":\"2012\",\"bibtex\":\"@inproceedings{buyukalp_untrusting_2012,\\n type={4},\\n author = {Buyukalp, Y. and Maatouk, G. and Prabhakaran, V. M. and Fragouli, C.},\\n booktitle = {Network {Coding} ({NetCod}), 2012 {International} {Symposium} on},\\n pages = {79--84},\\n publisher = {IEEE},\\n tags = {network_coding,security},\\n title = {Untrusting network coding},\\n year = {2012}\\n}\\n\\n\",\"author_short\":[\"Buyukalp, Y.\",\"Maatouk, G.\",\"Prabhakaran, V. M.\",\"Fragouli, C.\"],\"key\":\"buyukalp_untrusting_2012\",\"id\":\"buyukalp_untrusting_2012\",\"bibbaseid\":\"buyukalp-maatouk-prabhakaran-fragouli-untrustingnetworkcoding-2012\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tuninetti\"],\"firstnames\":[\"D.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"tags\":\"wireless\",\"title\":\"On Network Simplification for Gaussian Half-Duplex Diamond Networks\",\"year\":\"2016\",\"bibtex\":\"@inproceedings{cardone_network_2016,\\n type={4},\\n author = {Cardone, M. and Fragouli, C. and Tuninetti, D.},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n tags = {wireless},\\n title = {On {Network} {Simplification} for {Gaussian} {Half}-{Duplex} {Diamond} {Networks}},\\n year = {2016}\\n}\\n\\n\",\"author_short\":[\"Cardone, M.\",\"Fragouli, C.\",\"Tuninetti, D.\"],\"key\":\"cardone_network_2016\",\"id\":\"cardone_network_2016\",\"bibbaseid\":\"cardone-fragouli-tuninetti-onnetworksimplificationforgaussianhalfduplexdiamondnetworks-2016\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"A non-uniform demand network consists of a source and a set of receivers that have different min-cut values from the source. We look at the case where the receivers would like to receive from the source a rate that is (approximately) equal to their min-cut value. We formulate this problem and its relaxations and present preliminary results.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Chekuri\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Soljanin\"],\"firstnames\":[\"E.\"],\"suffixes\":[]}],\"journal\":\"ISIT\",\"tags\":\"network_coding\",\"title\":\"On achievable information rates in single-source non-uniform demand networks\",\"year\":\"2006\",\"bibtex\":\"@article{chekuri_achievable_2006,\\n abstract = {A non-uniform demand network consists of a source and a set of receivers that have different min-cut values from the source. We look at the case where the receivers would like to receive from the source a rate that is (approximately) equal to their min-cut value. We formulate this problem and its relaxations and present preliminary results.},\\n type={4},\\n author = {Chekuri, C. and Fragouli, C. and Soljanin, E.},\\n journal = {ISIT},\\n tags = {network_coding},\\n title = {On achievable information rates in single-source non-uniform demand networks},\\n year = {2006}\\n}\\n\\n\",\"author_short\":[\"Chekuri, C.\",\"Fragouli, C.\",\"Soljanin, E.\"],\"key\":\"chekuri_achievable_2006\",\"id\":\"chekuri_achievable_2006\",\"bibbaseid\":\"chekuri-fragouli-soljanin-onachievableinformationratesinsinglesourcenonuniformdemandnetworks-2006\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"We analyze a special class of configurations with $h$ sources and $N$ receivers to demonstrate the throughput benefits of network coding and deterministic code design. We show that the throughput benefits network coding offers can increase proportionally to ${\\\\}sqrtN$, with respect to the average as well as the minimum throughput. We also show that while for this class of configurations there exists a deterministic coding scheme that realizes these benefits using a binary alphabet, randomized coding may require an exponentially large alphabet size.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Chekuri\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Soljanin\"],\"firstnames\":[\"E.\"],\"suffixes\":[]}],\"journal\":\"ISIT\",\"tags\":\"network_coding\",\"title\":\"On average throughput benefits and alphabet size in network Coding\",\"year\":\"2005\",\"bibtex\":\"@article{chekuri_average_2005,\\n abstract = {We analyze a special class of configurations with \\\\$h\\\\$ sources and \\\\$N\\\\$ receivers to demonstrate the throughput benefits of network coding and deterministic code design. We show that the throughput benefits network coding offers can increase proportionally to \\\\${\\\\textbackslash}sqrtN\\\\$, with respect to the average as well as the minimum throughput. We also show that while for this class of configurations there exists a deterministic coding scheme that realizes these benefits using a binary alphabet, randomized coding may require an exponentially large alphabet size.},\\n type={4},\\n author = {Chekuri, C. and Fragouli, C. and Soljanin, E.},\\n journal = {ISIT},\\n tags = {network_coding},\\n title = {On average throughput benefits and alphabet size in network {Coding}},\\n year = {2005}\\n}\\n\\n\",\"author_short\":[\"Chekuri, C.\",\"Fragouli, C.\",\"Soljanin, E.\"],\"key\":\"chekuri_average_2005\",\"id\":\"chekuri_average_2005\",\"bibbaseid\":\"chekuri-fragouli-soljanin-onaveragethroughputbenefitsandalphabetsizeinnetworkcoding-2005\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"We examine the throughput benefits that network coding offers with respect to the average throughput achievable by routing, where the average throughput refers to the average of the rates that the individual receivers experience. We relate these benefits to the integrality gap of a standard LP formulation for the directed Steiner tree problem. We describe families of configurations over which network coding at most doubles the average throughput, and analyze a class of directed graph configurations with $N$ receivers where network coding offers benefits proportional to ${\\\\}sqrtN$. We also discuss other throughput measures in networks, and show how in certain classes of networks, the average throughput can be achieved uniformly by all receivers by employing vector routing and channel coding. Finally, we show configurations where use of randomized coding may require an alphabet size exponentially larger than the minimum alphabet size required.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Chekuri\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Soljanin\"],\"firstnames\":[\"E.\"],\"suffixes\":[]}],\"journal\":\"IEEE Trans. Inform. Theory\",\"tags\":\"network_coding\",\"title\":\"On Average Throughput Benefits and Alphabet Size in Network Coding\",\"year\":\"2006\",\"bibtex\":\"@article{chekuri_average_2006,\\n abstract = {We examine the throughput benefits that network coding offers with respect to the average throughput achievable by routing, where the average throughput refers to the average of the rates that the individual receivers experience. We relate these benefits to the integrality gap of a standard LP formulation for the directed Steiner tree problem. We describe families of configurations over which network coding at most doubles the average throughput, and analyze a class of directed graph configurations with \\\\$N\\\\$ receivers where network coding offers benefits proportional to \\\\${\\\\textbackslash}sqrtN\\\\$. We also discuss other throughput measures in networks, and show how in certain classes of networks, the average throughput can be achieved uniformly by all receivers by employing vector routing and channel coding. Finally, we show configurations where use of randomized coding may require an alphabet size exponentially larger than the minimum alphabet size required.},\\n type={4},\\n author = {Chekuri, C. and Fragouli, C. and Soljanin, E.},\\n journal = {IEEE Trans. Inform. Theory},\\n tags = {network_coding},\\n title = {On {Average} {Throughput} {Benefits} and {Alphabet} {Size} in {Network} {Coding}},\\n year = {2006}\\n}\\n\\n\",\"author_short\":[\"Chekuri, C.\",\"Fragouli, C.\",\"Soljanin, E.\"],\"key\":\"chekuri_average_2006\",\"id\":\"chekuri_average_2006\",\"bibbaseid\":\"chekuri-fragouli-soljanin-onaveragethroughputbenefitsandalphabetsizeinnetworkcoding-2006\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"V.\",\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"month\":\"February\",\"publisher\":\"IEEE\",\"tags\":\"security\",\"title\":\"Broadcasting Private Messages Securely\",\"year\":\"2012\",\"bibtex\":\"@inproceedings{czap_broadcasting_2012,\\n type={4},\\n author = {Czap, L. and Prabhakaran, V. M. and Diggavi, Suhas N. and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n month = {February},\\n publisher = {IEEE},\\n tags = {security},\\n title = {Broadcasting {Private} {Messages} {Securely}},\\n year = {2012}\\n}\\n\\n\",\"author_short\":[\"Czap, L.\",\"Prabhakaran, V. M.\",\"Diggavi, S. N.\",\"Fragouli, C.\"],\"key\":\"czap_broadcasting_2012\",\"id\":\"czap_broadcasting_2012\",\"bibbaseid\":\"czap-prabhakaran-diggavi-fragouli-broadcastingprivatemessagessecurely-2012\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"V.\",\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]}],\"booktitle\":\"In submission\",\"tags\":\"security\",\"title\":\"Encrypt and mix: unconditionally optimal secure wireless broadcast\",\"year\":\"2012\",\"bibtex\":\"@inproceedings{czap_encrypt_2012,\\n type={4},\\n author = {Czap, L. and Prabhakaran, V. M. and Fragouli, C. and Diggavi, S.},\\n booktitle = {In submission},\\n tags = {security},\\n title = {Encrypt and mix: unconditionally optimal secure wireless broadcast},\\n year = {2012}\\n}\\n\\n\",\"author_short\":[\"Czap, L.\",\"Prabhakaran, V. M.\",\"Fragouli, C.\",\"Diggavi, S.\"],\"key\":\"czap_encrypt_2012\",\"id\":\"czap_encrypt_2012\",\"bibbaseid\":\"czap-prabhakaran-fragouli-diggavi-encryptandmixunconditionallyoptimalsecurewirelessbroadcast-2012\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"V.\",\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Information Theory Workshop (ITW)\",\"tags\":\"security\",\"title\":\"Exploiting Common Randomness: a Resource for Network Secrecy\",\"year\":\"2013\",\"bibtex\":\"@inproceedings{czap_exploiting_2013,\\n type={4},\\n author = {Czap, L. and Prabhakaran, V. M. and Diggavi, S. and Fragouli, C.},\\n booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},\\n tags = {security},\\n title = {Exploiting {Common} {Randomness}: a {Resource} for {Network} {Secrecy}},\\n year = {2013}\\n}\\n\\n\",\"author_short\":[\"Czap, L.\",\"Prabhakaran, V. M.\",\"Diggavi, S.\",\"Fragouli, C.\"],\"key\":\"czap_exploiting_2013\",\"id\":\"czap_exploiting_2013\",\"bibbaseid\":\"czap-prabhakaran-diggavi-fragouli-exploitingcommonrandomnessaresourcefornetworksecrecy-2013\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"V.\",\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"tags\":\"security\",\"title\":\"An LP Characterization of the Secret-message Capacity of Three Erasure Networks with Feedback\",\"year\":\"2016\",\"bibtex\":\"@article{czap_lp_2016,\\n type={2},\\n author = {Czap, L. and Fragouli, C. and Prabhakaran, V. M. and Diggavi, S.},\\n journal = {IEEE Transactions on Information Theory},\\n tags = {security},\\n title = {An {LP} {Characterization} of the {Secret}-message {Capacity} of {Three} {Erasure} {Networks} with {Feedback}},\\n year = {2016}\\n}\\n\\n\",\"author_short\":[\"Czap, L.\",\"Fragouli, C.\",\"Prabhakaran, V. M.\",\"Diggavi, S.\"],\"key\":\"czap_lp_2016\",\"id\":\"czap_lp_2016\",\"bibbaseid\":\"czap-fragouli-prabhakaran-diggavi-anlpcharacterizationofthesecretmessagecapacityofthreeerasurenetworkswithfeedback-2016\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"V.\",\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Information Theory Workshop (ITW)\",\"tags\":\"security\",\"title\":\"Secret message capacity of erasure broadcast channels with feedback\",\"year\":\"2011\",\"bibtex\":\"@inproceedings{czap_secret_2011,\\n type={4},\\n author = {Czap, L. and Prabhakaran, V. M. and Fragouli, C. and Diggavi, Suhas N.},\\n booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},\\n tags = {security},\\n title = {Secret message capacity of erasure broadcast channels with feedback},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Czap, L.\",\"Prabhakaran, V. M.\",\"Fragouli, C.\",\"Diggavi, S. N.\"],\"key\":\"czap_secret_2011\",\"id\":\"czap_secret_2011\",\"bibbaseid\":\"czap-prabhakaran-fragouli-diggavi-secretmessagecapacityoferasurebroadcastchannelswithfeedback-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"V.\",\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"tags\":\"security\",\"title\":\"Secret communication over broadcast erasure channels with state-feedback\",\"year\":\"2015\",\"bibtex\":\"@article{czap_secret_2015,\\n type={2},\\n author = {Czap, L. and Fragouli, C. and Prabhakaran, V. M. and Diggavi, Suhas},\\n journal = {IEEE Transactions on Information Theory},\\n tags = {security},\\n title = {Secret communication over broadcast erasure channels with state-feedback},\\n year = {2015}\\n}\\n\\n\",\"author_short\":[\"Czap, L.\",\"Fragouli, C.\",\"Prabhakaran, V. M.\",\"Diggavi, S.\"],\"key\":\"czap_secret_2015\",\"id\":\"czap_secret_2015\",\"bibbaseid\":\"czap-fragouli-prabhakaran-diggavi-secretcommunicationoverbroadcasterasurechannelswithstatefeedback-2015\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Network Coding (NetCod)\",\"month\":\"July\",\"tags\":\"security\",\"title\":\"On secure key exchange in wireless networks\",\"year\":\"2011\",\"bibtex\":\"@inproceedings{czap_secure_2011,\\n type={4},\\n author = {Czap, L. and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} on {Network} {Coding} ({NetCod})},\\n month = {July},\\n tags = {security},\\n title = {On secure key exchange in wireless networks},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Czap, L.\",\"Fragouli, C.\"],\"key\":\"czap_secure_2011\",\"id\":\"czap_secure_2011\",\"bibbaseid\":\"czap-fragouli-onsecurekeyexchangeinwirelessnetworks-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"V.\",\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]}],\"booktitle\":\"Annual Allerton Conference on Communication, Control, and Computing\",\"tags\":\"security\",\"title\":\"Secure Network Coding with Erasures and Feedback\",\"year\":\"2013\",\"bibtex\":\"@inproceedings{czap_secure_2013,\\n type={4},\\n author = {Czap, L. and Fragouli, C. and Prabhakaran, V. M. and Diggavi, Suhas},\\n booktitle = {Annual {Allerton} {Conference} on {Communication}, {Control}, and {Computing}},\\n tags = {security},\\n title = {Secure {Network} {Coding} with {Erasures} and {Feedback}},\\n year = {2013}\\n}\\n\\n\",\"author_short\":[\"Czap, L.\",\"Fragouli, C.\",\"Prabhakaran, V. M.\",\"Diggavi, S.\"],\"key\":\"czap_secure_2013\",\"id\":\"czap_secure_2013\",\"bibbaseid\":\"czap-fragouli-prabhakaran-diggavi-securenetworkcodingwitherasuresandfeedback-2013\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"V.\",\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"tags\":\"security\",\"title\":\"Secure network coding with erasures and feedback\",\"year\":\"2015\",\"bibtex\":\"@article{czap_secure_2015,\\n type={2},\\n author = {Czap, L. and Fragouli, C. and Prabhakaran, V. M. and Diggavi, Suhas},\\n journal = {IEEE Transactions on Information Theory},\\n tags = {security},\\n title = {Secure network coding with erasures and feedback},\\n year = {2015}\\n}\\n\\n\",\"author_short\":[\"Czap, L.\",\"Fragouli, C.\",\"Prabhakaran, V. M.\",\"Diggavi, S.\"],\"key\":\"czap_secure_2015\",\"id\":\"czap_secure_2015\",\"bibbaseid\":\"czap-fragouli-prabhakaran-diggavi-securenetworkcodingwitherasuresandfeedback-2015\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"V.\",\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Symposium on Network Coding (NetCod)\",\"tags\":\"security\",\"title\":\"Securing Broadcast Against Dishonest Receivers\",\"year\":\"2013\",\"bibtex\":\"@inproceedings{czap_securing_2013,\\n type={4},\\n author = {Czap, L. and Prabhakaran, V. M. and Diggavi, S. and Fragouli, C.},\\n booktitle = {{IEEE} {Symposium} on {Network} {Coding} ({NetCod})},\\n tags = {security},\\n title = {Securing {Broadcast} {Against} {Dishonest} {Receivers}},\\n year = {2013}\\n}\\n\\n\",\"author_short\":[\"Czap, L.\",\"Prabhakaran, V. M.\",\"Diggavi, S.\",\"Fragouli, C.\"],\"key\":\"czap_securing_2013\",\"id\":\"czap_securing_2013\",\"bibbaseid\":\"czap-prabhakaran-diggavi-fragouli-securingbroadcastagainstdishonestreceivers-2013\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"V.\",\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"tags\":\"security\",\"title\":\"Triangle network secrecy\",\"year\":\"2014\",\"bibtex\":\"@inproceedings{czap_triangle_2014,\\n type={4},\\n author = {Czap, L. and Prabhakaran, V. M. and Diggavi, Suhas and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n tags = {security},\\n title = {Triangle network secrecy},\\n year = {2014}\\n}\\n\\n\",\"author_short\":[\"Czap, L.\",\"Prabhakaran, V. M.\",\"Diggavi, S.\",\"Fragouli, C.\"],\"key\":\"czap_triangle_2014\",\"id\":\"czap_triangle_2014\",\"bibbaseid\":\"czap-prabhakaran-diggavi-fragouli-trianglenetworksecrecy-2014\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"We consider a power-efficient communication model for wireless sensor networks where silence is used to convey information. We study the average-case and worst-case complexities of symmetric functions under this model and describe protocols that achieve them. For binary-input functions, we determine the average complexity. For ternary-input functions, we consider a special type of protocols and provide close lower and upper bounds for their worst-case complexity. We also describe the protocol that achieves the average complexity.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Dhulipala\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Orlitsky\"],\"firstnames\":[\"A.\"],\"suffixes\":[]}],\"journal\":\"ISIT\",\"tags\":\"sensor_networks\",\"title\":\"Silence based communication for sensor networks\",\"year\":\"2006\",\"bibtex\":\"@article{dhulipala_silence_2006,\\n abstract = {We consider a power-efficient communication model for wireless sensor networks where silence is used to convey information. We study the average-case and worst-case complexities of symmetric functions under this model and describe protocols that achieve them. For binary-input functions, we determine the average complexity. For ternary-input functions, we consider a special type of protocols and provide close lower and upper bounds for their worst-case complexity. We also describe the protocol that achieves the average complexity.},\\n type={4},\\n author = {Dhulipala, A. and Fragouli, C. and Orlitsky, A.},\\n journal = {ISIT},\\n tags = {sensor_networks},\\n title = {Silence based communication for sensor networks},\\n year = {2006}\\n}\\n\\n\",\"author_short\":[\"Dhulipala, A.\",\"Fragouli, C.\",\"Orlitsky, A.\"],\"key\":\"dhulipala_silence_2006\",\"id\":\"dhulipala_silence_2006\",\"bibbaseid\":\"dhulipala-fragouli-orlitsky-silencebasedcommunicationforsensornetworks-2006\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"Communication complexity—the minimum amount of communication required—of computing a function of data held by several parties is studied. A communication model where silence is used to convey information is introduced. For this model the worst-case and average-case complexities of symmetric functions are studied. For binary-input functions the average- and worst-case complexities are determined and the protocols achieving them are described. For functions of non-binary inputs one-round communication, where each party is restricted to communicate in consecutive stages, is considered and the extra amount of communication required by one- over multi-round communication is analyzed. For the special case of ternary-input functions close lower and upper bounds on the worst-case one-round complexity are provided and protocols achieving them are described. Protocols achieving the average-case one-round complexity for ternary-input functions are also described. These protocols can be generalized to inputs of arbitrary size.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Dhulipala\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Orlitsky\"],\"firstnames\":[\"A.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"tags\":\"sensor_networks\",\"title\":\"Silence based communication\",\"volume\":\"56\",\"year\":\"2010\",\"bibtex\":\"@article{dhulipala_silence_2010,\\n abstract = {Communication complexity—the minimum amount of communication required—of computing a function of data held by several parties is studied. A communication model where silence is used to convey information is introduced. For this model the worst-case and average-case complexities of symmetric functions are studied. For binary-input functions the average- and worst-case complexities are determined and the protocols achieving them are described. For functions of non-binary inputs one-round communication, where each party is restricted to communicate in consecutive stages, is considered and the extra amount of communication required by one- over multi-round communication is analyzed. For the special case of ternary-input functions close lower and upper bounds on the worst-case one-round complexity are provided and protocols achieving them are described. Protocols achieving the average-case one-round complexity for ternary-input functions are also described. These protocols can be generalized to inputs of arbitrary size.},\\n type={2},\\n author = {Dhulipala, A. and Fragouli, C. and Orlitsky, A.},\\n journal = {IEEE Transactions on Information Theory},\\n tags = {sensor_networks},\\n title = {Silence based communication},\\n volume = {56},\\n year = {2010}\\n}\\n\\n\",\"author_short\":[\"Dhulipala, A.\",\"Fragouli, C.\",\"Orlitsky, A.\"],\"key\":\"dhulipala_silence_2010\",\"id\":\"dhulipala_silence_2010\",\"bibbaseid\":\"dhulipala-fragouli-orlitsky-silencebasedcommunication-2010\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"Communication complexity of computing functions using unrestricted communication and one-round communication are compared. In the standard unrestricted communication each party could potentially communicate several times while in one-round communication each party is restricted to communicate at most once. Results on the ratio of these two complexities are provided for symmetric and asymmetric functions under different scenarios. These results are suitably illustrated with examples.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Dhulipala\"],\"firstnames\":[\"Anand\",\"K.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Orlitsky\"],\"firstnames\":[\"Alon\"],\"suffixes\":[]}],\"booktitle\":\"Information Theory, 2007. ISIT 2007. IEEE International Symposium on\",\"doi\":\"10.1109/isit.2007.4557296\",\"month\":\"June\",\"pages\":\"636 –640\",\"tags\":\"CC\",\"title\":\"Single versus multiple rounds for distributed function computation\",\"year\":\"2007\",\"bibtex\":\"@inproceedings{dhulipala_single_2007,\\n abstract = {Communication complexity of computing functions using unrestricted communication and one-round communication are compared. In the standard unrestricted communication each party could potentially communicate several times while in one-round communication each party is restricted to communicate at most once. Results on the ratio of these two complexities are provided for symmetric and asymmetric functions under different scenarios. These results are suitably illustrated with examples.},\\n type={4},\\n author = {Dhulipala, Anand K. and Fragouli, C. and Orlitsky, Alon},\\n booktitle = {Information {Theory}, 2007. {ISIT} 2007. {IEEE} {International} {Symposium} on},\\n doi = {10.1109/isit.2007.4557296},\\n month = {June},\\n pages = {636 --640},\\n tags = {CC},\\n title = {Single versus multiple rounds for distributed function computation},\\n year = {2007}\\n}\\n\\n\",\"author_short\":[\"Dhulipala, A. K.\",\"Fragouli, C.\",\"Orlitsky, A.\"],\"key\":\"dhulipala_single_2007-1\",\"id\":\"dhulipala_single_2007-1\",\"bibbaseid\":\"dhulipala-fragouli-orlitsky-singleversusmultipleroundsfordistributedfunctioncomputation-2007\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Drinea\"],\"firstnames\":[\"Eleni\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Keller\"],\"firstnames\":[\"L.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"doi\":\"10.1109/isit.2009.5205612\",\"keywords\":\"network coding, channel coding, erasure channel, feedback, feedback information, multiple description coding, NP-hard, offline algorithm, offline minimization problem, online algorithm, online heuristics\",\"tags\":\"network_coding,wireless\",\"title\":\"Delay with network coding and feedback\",\"year\":\"2009\",\"bibtex\":\"@inproceedings{drinea_delay_2009,\\n type={4},\\n author = {Drinea, Eleni and Fragouli, C. and Keller, L.},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n doi = {10.1109/isit.2009.5205612},\\n keywords = {network coding, channel coding, erasure channel, feedback, feedback information, multiple description coding, NP-hard, offline algorithm, offline minimization problem, online algorithm, online heuristics},\\n tags = {network_coding,wireless},\\n title = {Delay with network coding and feedback},\\n year = {2009}\\n}\\n\\n\",\"author_short\":[\"Drinea, E.\",\"Fragouli, C.\",\"Keller, L.\"],\"key\":\"drinea_delay_2009\",\"id\":\"drinea_delay_2009\",\"bibbaseid\":\"drinea-fragouli-keller-delaywithnetworkcodingandfeedback-2009\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"network coding\",\"channel coding\",\"erasure channel\",\"feedback\",\"feedback information\",\"multiple description coding\",\"NP-hard\",\"offline algorithm\",\"offline minimization problem\",\"online algorithm\",\"online heuristics\"],\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Drinea\"],\"firstnames\":[\"Eleni\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Keller\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"doi\":\"10.1016/j.phycom.2012.05.005\",\"issn\":\"1874-4907\",\"journal\":\"Physical Communication\",\"keywords\":\"Delay\",\"number\":\"0\",\"tags\":\"network_coding\",\"title\":\"Real-time delay with network coding and feedback\",\"url\":\"http://www.sciencedirect.com/science/article/pii/S1874490712000444\",\"year\":\"2012\",\"bibtex\":\"@article{drinea_real-time_2012,\\n type={4},\\n author = {Drinea, Eleni and Keller, L. and Fragouli, C.},\\n doi = {10.1016/j.phycom.2012.05.005},\\n issn = {1874-4907},\\n journal = {Physical Communication},\\n keywords = {Delay},\\n number = {0},\\n tags = {network_coding},\\n title = {Real-time delay with network coding and feedback},\\n url = {http://www.sciencedirect.com/science/article/pii/S1874490712000444},\\n year = {2012}\\n}\\n\\n\",\"author_short\":[\"Drinea, E.\",\"Keller, L.\",\"Fragouli, C.\"],\"key\":\"drinea_real-time_2012\",\"id\":\"drinea_real-time_2012\",\"bibbaseid\":\"drinea-keller-fragouli-realtimedelaywithnetworkcodingandfeedback-2012\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://www.sciencedirect.com/science/article/pii/S1874490712000444\"},\"keyword\":[\"Delay\"],\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Duarte\",\"Gelvez\"],\"firstnames\":[\"Melissa\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Sengupta\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Brahma\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]}],\"booktitle\":\"ACM MOBIHOC\",\"tags\":\"wireless\",\"title\":\"Quantize-Map-Forward (QMF) Relaying - An Experimental Study\",\"year\":\"2013\",\"bibtex\":\"@inproceedings{duarte_gelvez_quantize-map-forward_2013,\\n type={4},\\n author = {Duarte Gelvez, Melissa and Sengupta, A. and Brahma, S. and Fragouli, C. and Diggavi, S.},\\n booktitle = {{ACM} {MOBIHOC}},\\n tags = {wireless},\\n title = {Quantize-{Map}-{Forward} ({QMF}) {Relaying} - {An} {Experimental} {Study}},\\n year = {2013}\\n}\\n\\n\",\"author_short\":[\"Duarte Gelvez, M.\",\"Sengupta, A.\",\"Brahma, S.\",\"Fragouli, C.\",\"Diggavi, S.\"],\"key\":\"duarte_gelvez_quantize-map-forward_2013\",\"id\":\"duarte_gelvez_quantize-map-forward_2013\",\"bibbaseid\":\"duartegelvez-sengupta-brahma-fragouli-diggavi-quantizemapforwardqmfrelayinganexperimentalstudy-2013\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Durvy\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Thiran\"],\"firstnames\":[\"P.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"publisher\":\"IEEE\",\"tags\":\"network_coding\",\"title\":\"On feedback for network coding\",\"year\":\"2007\",\"bibtex\":\"@inproceedings{durvy_feedback_2007,\\n type={4},\\n author = {Durvy, M. and Fragouli, C. and Thiran, P.},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n publisher = {IEEE},\\n tags = {network_coding},\\n title = {On feedback for network coding},\\n year = {2007}\\n}\\n\\n\",\"author_short\":[\"Durvy, M.\",\"Fragouli, C.\",\"Thiran, P.\"],\"key\":\"durvy_feedback_2007\",\"id\":\"durvy_feedback_2007\",\"bibbaseid\":\"durvy-fragouli-thiran-onfeedbackfornetworkcoding-2007\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"We propose a mechanism for reliable broadcasting in wireless networks, that consists of two components: a method for bandwidth efficient acknowledgment collection, and a coding scheme that uses acknowledgments. Our approach combines ideas from network coding and distributed space time coding.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Durvy\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Thiran\"],\"firstnames\":[\"P.\"],\"suffixes\":[]}],\"journal\":\"ISIT\",\"tags\":\"network_coding,wireless\",\"title\":\"Towards reliable broadcasting using ACKs\",\"year\":\"2007\",\"bibtex\":\"@article{durvy_towards_2007,\\n abstract = {We propose a mechanism for reliable broadcasting in wireless networks, that consists of two components: a method for bandwidth efficient acknowledgment collection, and a coding scheme that uses acknowledgments. Our approach combines ideas from network coding and distributed space time coding.},\\n type={4},\\n author = {Durvy, M. and Fragouli, C. and Thiran, P.},\\n journal = {ISIT},\\n tags = {network_coding,wireless},\\n title = {Towards reliable broadcasting using {ACKs}},\\n year = {2007}\\n}\\n\\n\",\"author_short\":[\"Durvy, M.\",\"Fragouli, C.\",\"Thiran, P.\"],\"key\":\"durvy_towards_2007\",\"id\":\"durvy_towards_2007\",\"bibbaseid\":\"durvy-fragouli-thiran-towardsreliablebroadcastingusingacks-2007\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ebrahimi\"],\"firstnames\":[\"Javad\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"International conference on Signal Processing and Communications (SPCOM)\",\"tags\":\"wireless\",\"title\":\"Algebraic techniques for deterministic networks\",\"year\":\"2010\",\"bibtex\":\"@inproceedings{ebrahimi_algebraic_2010,\\n type={4},\\n author = {Ebrahimi, Javad and Fragouli, C.},\\n booktitle = {International conference on {Signal} {Processing} and {Communications} ({SPCOM})},\\n tags = {wireless},\\n title = {Algebraic techniques for deterministic networks},\\n year = {2010}\\n}\\n\\n\",\"author_short\":[\"Ebrahimi, J.\",\"Fragouli, C.\"],\"key\":\"ebrahimi_algebraic_2010\",\"id\":\"ebrahimi_algebraic_2010\",\"bibbaseid\":\"ebrahimi-fragouli-algebraictechniquesfordeterministicnetworks-2010\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L x L coding matrices that play a similar role as coding coefficients in scalar coding. We start our work by extending the algebraic framework developed for multicasting over graphs in [1] to include operations over matrices; we build on this generalized framework, to provide a new approach for both scalar and vector code design which attempts to minimize the employed field size and employed vector length, while selecting the coding operations. Our algorithms also lead as a special case to network code designs that employ structured matrices.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ebrahimi\"],\"firstnames\":[\"Javad\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory (Special Issue on Facets of Coding Theory: from Algorithms to Networks)\",\"tags\":\"network_coding\",\"title\":\"Algorithms for vector network coding\",\"year\":\"2011\",\"bibtex\":\"@article{ebrahimi_algorithms_2011,\\n abstract = {We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L x L coding matrices that play a similar role as coding coefficients in scalar coding. We start our work by extending the algebraic framework developed for multicasting over graphs in [1] to include operations over matrices; we build on this generalized framework, to provide a new approach for both scalar and vector code design which attempts to minimize the employed field size and employed vector length, while selecting the coding operations. Our algorithms also lead as a special case to network code designs that employ structured matrices.},\\n type={2},\\n author = {Ebrahimi, Javad and Fragouli, C.},\\n journal = {IEEE Transactions on Information Theory (Special Issue on Facets of Coding Theory: from Algorithms to Networks)},\\n tags = {network_coding},\\n title = {Algorithms for vector network coding},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Ebrahimi, J.\",\"Fragouli, C.\"],\"key\":\"ebrahimi_algorithms_2011\",\"id\":\"ebrahimi_algorithms_2011\",\"bibbaseid\":\"ebrahimi-fragouli-algorithmsforvectornetworkcoding-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L x L coding matrices that play a similar role as coding coefficients in scalar coding. Vector network coding generalizes scalar coding, and thus offers a wider range of solutions over which to optimize. This paper starts exploring the new possibilities vector network coding can offer along two directions. First, we propose a new randomized algorithm for vector network coding. We compare the performance of our proposed algorithm with the existing randomized algorithms in the literature over a specific class of networks. Second, we explore the use of structured coding matrices for vector network coding. We present deterministic designs that allow to operate using rotation coding matrices and thus result in reduced encoding complexity.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ebrahimi\"],\"firstnames\":[\"Javad\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"48th Annual Allerton Conference on Communication, Control, and Computing\",\"tags\":\"network_coding\",\"title\":\"On the benefits of vector network coding\",\"year\":\"2010\",\"bibtex\":\"@inproceedings{ebrahimi_benefits_2010,\\n abstract = {In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L x L coding matrices that play a similar role as coding coefficients in scalar coding. Vector network coding generalizes scalar coding, and thus offers a wider range of solutions over which to optimize. This paper starts exploring the new possibilities vector network coding can offer along two directions. First, we propose a new randomized algorithm for vector network coding. We compare the performance of our proposed algorithm with the existing randomized algorithms in the literature over a specific class of networks. Second, we explore the use of structured coding matrices for vector network coding. We present deterministic designs that allow to operate using rotation coding matrices and thus result in reduced encoding complexity.},\\n type={4},\\n author = {Ebrahimi, Javad and Fragouli, C.},\\n booktitle = {48th {Annual} {Allerton} {Conference} on {Communication}, {Control}, and {Computing}},\\n tags = {network_coding},\\n title = {On the benefits of vector network coding},\\n year = {2010}\\n}\\n\\n\",\"author_short\":[\"Ebrahimi, J.\",\"Fragouli, C.\"],\"key\":\"ebrahimi_benefits_2010\",\"id\":\"ebrahimi_benefits_2010\",\"bibbaseid\":\"ebrahimi-fragouli-onthebenefitsofvectornetworkcoding-2010\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"A long-standing open question in information theory is to characterize the unicast capacity of a wireless relay network. The difficulty arises due to the complex signal interactions induced in the network, since the wireless channel inherently broadcasts the signals and there is interference among transmissions. Recently, Avestimehr, Diggavi and Tse proposed a linear deterministic model that takes into account the shared nature of wireless channels, focusing on the signal interactions rather than the background noise. They generalized the min-cut max-flow theorem for graphs to networks of deterministic channels and proved that the capacity can be achieved using information theoretical tools. They showed that the value of the minimum cut is in this case the minimum rank of all the adjacency matrices describing source-destination cuts. In this paper, we develop a polynomial time algorithm that discovers the relay encoding strategy to achieve the min-cut value in linear deterministic (wireless) networks, for the case of a unicast connection. Our algorithm crucially uses a notion of linear independence between channels to calculate the capacity in polynomial time. Moreover, we can achieve the capacity by using very simple one-symbol processing at the intermediate nodes, thereby constructively yielding finite length strategies that achieve the unicast capacity of the linear deterministic (wireless) relay network.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ebrahimi\"],\"firstnames\":[\"Javad\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"ACM Transactions on Algorithms\",\"tags\":\"network_coding,wireless\",\"title\":\"Combinatorial algorithms for wireless information flow\",\"year\":\"2011\",\"bibtex\":\"@article{ebrahimi_combinatorial_2011,\\n abstract = {A long-standing open question in information theory is to characterize the unicast capacity of a wireless relay network. The difficulty arises due to the complex signal interactions induced in the network, since the wireless channel inherently broadcasts the signals and there is interference among transmissions. Recently, Avestimehr, Diggavi and Tse proposed a linear deterministic model that takes into account the shared nature of wireless channels, focusing on the signal interactions rather than the background noise. They generalized the min-cut max-flow theorem for graphs to networks of deterministic channels and proved that the capacity can be achieved using information theoretical tools. They showed that the value of the minimum cut is in this case the minimum rank of all the adjacency matrices describing source-destination cuts. In this paper, we develop a polynomial time algorithm that discovers the relay encoding strategy to achieve the min-cut value in linear deterministic (wireless) networks, for the case of a unicast connection. Our algorithm crucially uses a notion of linear independence between channels to calculate the capacity in polynomial time. Moreover, we can achieve the capacity by using very simple one-symbol processing at the intermediate nodes, thereby constructively yielding finite length strategies that achieve the unicast capacity of the linear deterministic (wireless) relay network.},\\n type={2},\\n author = {Ebrahimi, Javad and Fragouli, C.},\\n journal = {ACM Transactions on Algorithms},\\n tags = {network_coding,wireless},\\n title = {Combinatorial algorithms for wireless information flow},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Ebrahimi, J.\",\"Fragouli, C.\"],\"key\":\"ebrahimi_combinatorial_2011\",\"id\":\"ebrahimi_combinatorial_2011\",\"bibbaseid\":\"ebrahimi-fragouli-combinatorialalgorithmsforwirelessinformationflow-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"We present a polynomial time algorithm for multicasting rate h to N receivers over deterministic networks. Our algorithm requires intermediate network nodes to perform coding operations over vectors of a finite length L, through multiplication with L #x00D7; L binary coding matrices that play the same role as coding coefficients over graphs. Our code design consists in selecting these matrices so that each receiver is able to recover the source information. As a special case, we provide an alternative construction for a unicast algorithm over deterministic networks.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ebrahimi\"],\"firstnames\":[\"Javad\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Information Theory Workshop (ITW)\",\"doi\":\"10.1109/itwksps.2010.5503221\",\"month\":\"January\",\"tags\":\"wireless\",\"title\":\"Multicasting algorithms for deterministic networks\",\"year\":\"2010\",\"bibtex\":\"@inproceedings{ebrahimi_multicasting_2010,\\n abstract = {We present a polynomial time algorithm for multicasting rate h to N receivers over deterministic networks. Our algorithm requires intermediate network nodes to perform coding operations over vectors of a finite length L, through multiplication with L \\\\#x00D7; L binary coding matrices that play the same role as coding coefficients over graphs. Our code design consists in selecting these matrices so that each receiver is able to recover the source information. As a special case, we provide an alternative construction for a unicast algorithm over deterministic networks.},\\n type={4},\\n author = {Ebrahimi, Javad and Fragouli, C.},\\n booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},\\n doi = {10.1109/itwksps.2010.5503221},\\n month = {January},\\n tags = {wireless},\\n title = {Multicasting algorithms for deterministic networks},\\n year = {2010}\\n}\\n\\n\",\"author_short\":[\"Ebrahimi, J.\",\"Fragouli, C.\"],\"key\":\"ebrahimi_multicasting_2010\",\"id\":\"ebrahimi_multicasting_2010\",\"bibbaseid\":\"ebrahimi-fragouli-multicastingalgorithmsfordeterministicnetworks-2010\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ebrahimi\"],\"firstnames\":[\"J.\",\"B.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on\",\"pages\":\"1306–1310\",\"publisher\":\"IEEE\",\"tags\":\"network_coding\",\"title\":\"Properties of network polynomials\",\"year\":\"2012\",\"bibtex\":\"@inproceedings{ebrahimi_properties_2012,\\n type={4},\\n author = {Ebrahimi, J. B. and Fragouli, C.},\\n booktitle = {Information {Theory} {Proceedings} ({ISIT}), 2012 {IEEE} {International} {Symposium} on},\\n pages = {1306--1310},\\n publisher = {IEEE},\\n tags = {network_coding},\\n title = {Properties of network polynomials},\\n year = {2012}\\n}\\n\\n\",\"author_short\":[\"Ebrahimi, J. B.\",\"Fragouli, C.\"],\"key\":\"ebrahimi_properties_2012\",\"id\":\"ebrahimi_properties_2012\",\"bibbaseid\":\"ebrahimi-fragouli-propertiesofnetworkpolynomials-2012\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L x L coding matrices that play a similar role as coding coefficients in scalar coding. Our algorithms for scalar network jointly optimize the employed field size while selecting the coding coefficients. Similarly, for vector coding, our algorithms optimize the length L while designing the coding matrices. These algorithms apply both for regular network graphs as well as linear deterministic networks.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ebrahimi\"],\"firstnames\":[\"Javad\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"doi\":\"10.1109/isit.2010.5513771\",\"keywords\":\"algebraic algorithms, coding coefficients, coding matrices, intermediate node process, linear deterministic networks, matrix algebra, network coding, network graphs, network theory (graphs), scalar network coding, source multicast information, vector network coding algorithms\",\"tags\":\"network_coding\",\"title\":\"Vector network coding\",\"year\":\"2010\",\"bibtex\":\"@inproceedings{ebrahimi_vector_2010,\\n abstract = {We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L x L coding matrices that play a similar role as coding coefficients in scalar coding. Our algorithms for scalar network jointly optimize the employed field size while selecting the coding coefficients. Similarly, for vector coding, our algorithms optimize the length L while designing the coding matrices. These algorithms apply both for regular network graphs as well as linear deterministic networks.},\\n type={4},\\n author = {Ebrahimi, Javad and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n doi = {10.1109/isit.2010.5513771},\\n keywords = {algebraic algorithms, coding coefficients, coding matrices, intermediate node process, linear deterministic networks, matrix algebra, network coding, network graphs, network theory (graphs), scalar network coding, source multicast information, vector network coding algorithms},\\n tags = {network_coding},\\n title = {Vector network coding},\\n year = {2010}\\n}\\n\\n\",\"author_short\":[\"Ebrahimi, J.\",\"Fragouli, C.\"],\"key\":\"ebrahimi_vector_2010\",\"id\":\"ebrahimi_vector_2010\",\"bibbaseid\":\"ebrahimi-fragouli-vectornetworkcoding-2010\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"algebraic algorithms\",\"coding coefficients\",\"coding matrices\",\"intermediate node process\",\"linear deterministic networks\",\"matrix algebra\",\"network coding\",\"network graphs\",\"network theory (graphs)\",\"scalar network coding\",\"source multicast information\",\"vector network coding algorithms\"],\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Y.\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tuninetti\"],\"firstnames\":[\"D.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"tags\":\"wireless\",\"title\":\"The Approximate Capacity of Half-Duplex Line Networks\",\"year\":\"2020\",\"bibtex\":\"@article{ezzeldin_approximate_2020,\\n type={2},\\n author = {Ezzeldin, Y. H. and Cardone, M. and Fragouli, C. and Tuninetti, D.},\\n journal = {IEEE Transactions on Information Theory},\\n tags = {wireless},\\n title = {The {Approximate} {Capacity} of {Half}-{Duplex} {Line} {Networks}},\\n year = {2020}\\n}\\n\\n\",\"author_short\":[\"Ezzeldin, Y. H.\",\"Cardone, M.\",\"Fragouli, C.\",\"Tuninetti, D.\"],\"key\":\"ezzeldin_approximate_2020\",\"id\":\"ezzeldin_approximate_2020\",\"bibbaseid\":\"ezzeldin-cardone-fragouli-tuninetti-theapproximatecapacityofhalfduplexlinenetworks-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Y.\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tuninetti\"],\"firstnames\":[\"D.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"tags\":\"wireless\",\"title\":\"Efficiently Finding Simple Schedules in Gaussian Half-Duplex Relay Line Networks\",\"year\":\"2017\",\"bibtex\":\"@inproceedings{ezzeldin_efficiently_2017,\\n type={4},\\n author = {Ezzeldin, Y. H. and Cardone, M. and Fragouli, C. and Tuninetti, D.},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n tags = {wireless},\\n title = {Efficiently {Finding} {Simple} {Schedules} in {Gaussian} {Half}-{Duplex} {Relay} {Line} {Networks}},\\n year = {2017}\\n}\\n\\n\",\"author_short\":[\"Ezzeldin, Y. H.\",\"Cardone, M.\",\"Fragouli, C.\",\"Tuninetti, D.\"],\"key\":\"ezzeldin_efficiently_2017\",\"id\":\"ezzeldin_efficiently_2017\",\"bibbaseid\":\"ezzeldin-cardone-fragouli-tuninetti-efficientlyfindingsimpleschedulesingaussianhalfduplexrelaylinenetworks-2017\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Y.\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Caire\"],\"firstnames\":[\"Giuseppe\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"tags\":\"wireless\",\"title\":\"Gaussian 1-2-1 Networks: Capacity Results for mmWave Communications\",\"year\":\"2018\",\"bibtex\":\"@inproceedings{ezzeldin_gaussian_2018,\\n type={4},\\n author = {Ezzeldin, Y. H. and Cardone, M. and Fragouli, C. and Caire, Giuseppe},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n tags = {wireless},\\n title = {Gaussian 1-2-1 {Networks}: {Capacity} {Results} for {mmWave} {Communications}},\\n year = {2018}\\n}\\n\\n\",\"author_short\":[\"Ezzeldin, Y. H.\",\"Cardone, M.\",\"Fragouli, C.\",\"Caire, G.\"],\"key\":\"ezzeldin_gaussian_2018\",\"id\":\"ezzeldin_gaussian_2018\",\"bibbaseid\":\"ezzeldin-cardone-fragouli-caire-gaussian121networkscapacityresultsformmwavecommunications-2018\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Y.\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tuninetti\"],\"firstnames\":[\"D.\"],\"suffixes\":[]}],\"booktitle\":\"Annual Allerton Conference on Communication, Control and Computing (Allerton)\",\"tags\":\"wireless\",\"title\":\"Half-Duplex Routing is NP-hard\",\"year\":\"2017\",\"bibtex\":\"@inproceedings{ezzeldin_half-duplex_2017,\\n type={4},\\n author = {Ezzeldin, Y. H. and Cardone, M. and Fragouli, C. and Tuninetti, D.},\\n booktitle = {Annual {Allerton} {Conference} on {Communication}, {Control} and {Computing} ({Allerton})},\\n tags = {wireless},\\n title = {Half-{Duplex} {Routing} is {NP}-hard},\\n year = {2017}\\n}\\n\\n\",\"author_short\":[\"Ezzeldin, Y. H.\",\"Cardone, M.\",\"Fragouli, C.\",\"Tuninetti, D.\"],\"key\":\"ezzeldin_half-duplex_2017\",\"id\":\"ezzeldin_half-duplex_2017\",\"bibbaseid\":\"ezzeldin-cardone-fragouli-tuninetti-halfduplexroutingisnphard-2017\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Y.\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Caire\"],\"firstnames\":[\"Giuseppe\"],\"suffixes\":[]}],\"journal\":\"IEEE International Symposium of Information Theory (ISIT)\",\"tags\":\"wireless\",\"title\":\"On the Multicast Capacity of Full-Duplex 1-2-1 Networks\",\"year\":\"2019\",\"bibtex\":\"@article{ezzeldin_multicast_2019,\\n type={4},\\n author = {Ezzeldin, Y. H. and Cardone, M. and Fragouli, C. and Caire, Giuseppe},\\n journal = {IEEE International Symposium of Information Theory (ISIT)},\\n tags = {wireless},\\n title = {On the {Multicast} {Capacity} of {Full}-{Duplex} 1-2-1 {Networks}},\\n year = {2019}\\n}\\n\\n\",\"author_short\":[\"Ezzeldin, Y. H.\",\"Cardone, M.\",\"Fragouli, C.\",\"Caire, G.\"],\"key\":\"ezzeldin_multicast_2019\",\"id\":\"ezzeldin_multicast_2019\",\"bibbaseid\":\"ezzeldin-cardone-fragouli-caire-onthemulticastcapacityoffullduplex121networks-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Y.\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tuninetti\"],\"firstnames\":[\"D.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"tags\":\"wireless\",\"title\":\"Network Simplification: Building on Submodularity\",\"year\":\"2019\",\"bibtex\":\"@article{ezzeldin_network_2019,\\n type={2},\\n author = {Ezzeldin, Y. H. and Cardone, M. and Fragouli, C. and Tuninetti, D.},\\n journal = {IEEE Transactions on Information Theory},\\n tags = {wireless},\\n title = {Network {Simplification}: {Building} on {Submodularity}},\\n year = {2019}\\n}\\n\\n\",\"author_short\":[\"Ezzeldin, Y. H.\",\"Cardone, M.\",\"Fragouli, C.\",\"Tuninetti, D.\"],\"key\":\"ezzeldin_network_2019\",\"id\":\"ezzeldin_network_2019\",\"bibbaseid\":\"ezzeldin-cardone-fragouli-tuninetti-networksimplificationbuildingonsubmodularity-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Y.\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Caire\"],\"firstnames\":[\"Giuseppe\"],\"suffixes\":[]}],\"journal\":\"IEEE International Symposium of Information Theory (ISIT)\",\"tags\":\"wireless\",\"title\":\"Polynomial-time Capacity Calculation and Scheduling for Half-Duplex 1-2-1 Network\",\"year\":\"2019\",\"bibtex\":\"@article{ezzeldin_polynomial-time_2019,\\n type={4},\\n author = {Ezzeldin, Y. H. and Cardone, M. and Fragouli, C. and Caire, Giuseppe},\\n journal = {IEEE International Symposium of Information Theory (ISIT)},\\n tags = {wireless},\\n title = {Polynomial-time {Capacity} {Calculation} and {Scheduling} for {Half}-{Duplex} 1-2-1 {Network}},\\n year = {2019}\\n}\\n\\n\\n\",\"author_short\":[\"Ezzeldin, Y. H.\",\"Cardone, M.\",\"Fragouli, C.\",\"Caire, G.\"],\"key\":\"ezzeldin_polynomial-time_2019\",\"id\":\"ezzeldin_polynomial-time_2019\",\"bibbaseid\":\"ezzeldin-cardone-fragouli-caire-polynomialtimecapacitycalculationandschedulingforhalfduplex121network-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Y.\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Sengupta\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"tags\":\"wireless\",\"title\":\"Wireless Network Simplification: Beyond Diamond Networks\",\"year\":\"2016\",\"bibtex\":\"@inproceedings{ezzeldin_wireless_2016,\\n type={4},\\n author = {Ezzeldin, Y. H. and Sengupta, A. and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n tags = {wireless},\\n title = {Wireless {Network} {Simplification}: {Beyond} {Diamond} {Networks}},\\n year = {2016}\\n}\\n\\n\",\"author_short\":[\"Ezzeldin, Y. H.\",\"Sengupta, A.\",\"Fragouli, C.\"],\"key\":\"ezzeldin_wireless_2016\",\"id\":\"ezzeldin_wireless_2016\",\"bibbaseid\":\"ezzeldin-sengupta-fragouli-wirelessnetworksimplificationbeyonddiamondnetworks-2016\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ezzeldin\"],\"firstnames\":[\"Y.\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Sengupta\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"tags\":\"wireless\",\"title\":\"Wireless Network Simplification: The Performance of Routing\",\"year\":\"2020\",\"bibtex\":\"@article{ezzeldin_wireless_2020,\\n type={2},\\n author = {Ezzeldin, Y. H. and Sengupta, A. and Fragouli, C.},\\n journal = {IEEE Transactions on Information Theory},\\n tags = {wireless},\\n title = {Wireless {Network} {Simplification}: {The} {Performance} of {Routing}},\\n year = {2020}\\n}\\n\\n\",\"author_short\":[\"Ezzeldin, Y. H.\",\"Sengupta, A.\",\"Fragouli, C.\"],\"key\":\"ezzeldin_wireless_2020\",\"id\":\"ezzeldin_wireless_2020\",\"bibbaseid\":\"ezzeldin-sengupta-fragouli-wirelessnetworksimplificationtheperformanceofrouting-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"We calculate the average throughput benefit that network coding can offer as compared to routing for different classes of multicast configurations over directed graphs. The averaging is over the throughput each individual receiver experiences. For the cases we examine, network coding at most doubles the average throughput.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Soljanin\"],\"firstnames\":[\"E.\"],\"suffixes\":[]}],\"journal\":\"Allerton\",\"tags\":\"network_coding\",\"title\":\"On Average Throughput Benefits for Network Coding\",\"year\":\"2004\",\"bibtex\":\"@article{fragouli_average_2004,\\n abstract = {We calculate the average throughput benefit that network coding can offer as compared to routing for different classes of multicast configurations over directed graphs. The averaging is over the throughput each individual receiver experiences. For the cases we examine, network coding at most doubles the average throughput.},\\n type={4},\\n author = {Fragouli, C. and Soljanin, E.},\\n journal = {Allerton},\\n tags = {network_coding},\\n title = {On {Average} {Throughput} {Benefits} for {Network} {Coding}},\\n year = {2004}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Soljanin, E.\"],\"key\":\"fragouli_average_2004\",\"id\":\"fragouli_average_2004\",\"bibbaseid\":\"fragouli-soljanin-onaveragethroughputbenefitsfornetworkcoding-2004\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"We argue that the main benefits of network coding in a wireless environment might manifest in situations where the topology dynamically changes, and operation is restricted to distributed algorithms that do not employ knowledge about the network environment. We consider several problem instances in this set-up, that include broadcasting information to all nodes of the network and collecting sensor measurements. We show that in many such cases, under some simplifying assumptions, the problem is theoretically equivalent to simple variations of the coupon collector problem. Thus network coding can offer benefits of a factor of ${\\\\}log n$, where $n$ is the number of nodes and the benefits are in terms of energy efficiency, as was proven in the literature. We present simulation results under more realistic conditions that support this claim.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Widmer\"],\"firstnames\":[\"J.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Le\",\"Boudec\"],\"firstnames\":[\"J.-Y.\"],\"suffixes\":[]}],\"journal\":\"2nd Network Coding Workshop\",\"tags\":\"network_coding,wireless\",\"title\":\"On the benefits of network coding for wireless applications\",\"year\":\"2006\",\"bibtex\":\"@article{fragouli_benefits_2006,\\n abstract = {We argue that the main benefits of network coding in a wireless environment might manifest in situations where the topology dynamically changes, and operation is restricted to distributed algorithms that do not employ knowledge about the network environment. We consider several problem instances in this set-up, that include broadcasting information to all nodes of the network and collecting sensor measurements. We show that in many such cases, under some simplifying assumptions, the problem is theoretically equivalent to simple variations of the coupon collector problem. Thus network coding can offer benefits of a factor of \\\\${\\\\textbackslash}log n\\\\$, where \\\\$n\\\\$ is the number of nodes and the benefits are in terms of energy efficiency, as was proven in the literature. We present simulation results under more realistic conditions that support this claim.},\\n type={4},\\n author = {Fragouli, C. and Widmer, J. and Le Boudec, J.-Y.},\\n journal = {2nd Network Coding Workshop},\\n tags = {network_coding,wireless},\\n title = {On the benefits of network coding for wireless applications},\\n year = {2006}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Widmer, J.\",\"Le Boudec, J.\"],\"key\":\"fragouli_benefits_2006\",\"id\":\"fragouli_benefits_2006\",\"bibbaseid\":\"fragouli-widmer-leboudec-onthebenefitsofnetworkcodingforwirelessapplications-2006\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"This paper compares bit versus symbol interleaving for parallel-concatenated trellis-coded turbo codes, employing the turbo encoder structure proposed in Benedetto et al., (1996). To compare systems optimized with the same techniques, the paper extends the turbo-encoder design procedure proposed in Fragouli et al. (2001), to bit-interleaved systems. We discuss a method to jointly design the multiple required interleavers for the bit-interleaved system, and a procedure to select constituent encoders that can take advantage of the interleaver structure to achieve a low error floor. Simulation results for the designed bit-interleaved system show better performance than bit-interleaved performance reported in the literature. The symbol-interleaved system though achieves an earlier convergence, especially with an increased number of decoder iterations, but at the cost of a slightly higher error floor.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wesel\"],\"firstnames\":[\"R.\",\"D.\"],\"suffixes\":[]}],\"journal\":\"GlobeCom\",\"pages\":\"pages 931–935\",\"tags\":\"channel_coding\",\"title\":\"Bit vs. Symbol Interleaving for Parallel Concatenated Trellis Coded Modulation\",\"volume\":\"vol. 2\",\"year\":\"2001\",\"bibtex\":\"@article{fragouli_bit_2001,\\n abstract = {This paper compares bit versus symbol interleaving for parallel-concatenated trellis-coded turbo codes, employing the turbo encoder structure proposed in Benedetto et al., (1996). To compare systems optimized with the same techniques, the paper extends the turbo-encoder design procedure proposed in Fragouli et al. (2001), to bit-interleaved systems. We discuss a method to jointly design the multiple required interleavers for the bit-interleaved system, and a procedure to select constituent encoders that can take advantage of the interleaver structure to achieve a low error floor. Simulation results for the designed bit-interleaved system show better performance than bit-interleaved performance reported in the literature. The symbol-interleaved system though achieves an earlier convergence, especially with an increased number of decoder iterations, but at the cost of a slightly higher error floor.},\\n type={4},\\n author = {Fragouli, C. and Wesel, R. D.},\\n journal = {GlobeCom},\\n pages = {pages 931--935},\\n tags = {channel_coding},\\n title = {Bit vs. {Symbol} {Interleaving} for {Parallel} {Concatenated} {Trellis} {Coded} {Modulation}},\\n volume = {vol. 2},\\n year = {2001}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Wesel, R. D.\"],\"key\":\"fragouli_bit_2001\",\"id\":\"fragouli_bit_2001\",\"bibbaseid\":\"fragouli-wesel-bitvssymbolinterleavingforparallelconcatenatedtrelliscodedmodulation-2001\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"In this paper we propose a set of necessary and sufficient conditions under which the throughput in an ad-hoc network can remain constant as the number of nodes $n$ increases. Throughput refers to the minimum achievable rate between a source-destination pair for a given routing mechanism and physical model, when the network is shared by ${\\\\}Theta(n)$ randomly chosen source-destination pairs. The main idea is to use a \\\\em connectivity graph, that does not represent the actual physical network, but rather the available communication resources. This graph also allows to translate the problem of maximizing t he throughput in ad-hoc networks to the multicommodity flow problem and directly apply related results.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tabet\"],\"firstnames\":[\"T.\"],\"suffixes\":[]}],\"journal\":\"ACM Transactions on Sensor Networks\",\"pages\":\"359–379\",\"tags\":\"sensor_networks\",\"title\":\"Conditions for constant throughput in wireless networks\",\"volume\":\"2\",\"year\":\"2005\",\"bibtex\":\"@article{fragouli_conditions_2005,\\n abstract = {In this paper we propose a set of necessary and sufficient conditions under which the throughput in an ad-hoc network can remain constant as the number of nodes \\\\$n\\\\$ increases. Throughput refers to the minimum achievable rate between a source-destination pair for a given routing mechanism and physical model, when the network is shared by \\\\${\\\\textbackslash}Theta(n)\\\\$ randomly chosen source-destination pairs. The main idea is to use a {\\\\textbackslash}em connectivity graph, that does not represent the actual physical network, but rather the available communication resources. This graph also allows to translate the problem of maximizing t he throughput in ad-hoc networks to the multicommodity flow problem and directly apply related results.},\\n type={2},\\n author = {Fragouli, C. and Tabet, T.},\\n journal = {ACM Transactions on Sensor Networks},\\n pages = {359--379},\\n tags = {sensor_networks},\\n title = {Conditions for constant throughput in wireless networks},\\n volume = {2},\\n year = {2005}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Tabet, T.\"],\"key\":\"fragouli_conditions_2005\",\"id\":\"fragouli_conditions_2005\",\"bibbaseid\":\"fragouli-tabet-conditionsforconstantthroughputinwirelessnetworks-2005\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"The min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by liner re-encoding at nodes in communications networks, the min-cut rate can be also achieved in multicasting to several sinks. In this paper we discuss connections between such coding schemes and convolutional codes. We propose a method to simplify the convolutionalencoder design that is based on a subtree decompositionof the network line graph, describe the structure of the associated matrices, investigate methods to reduce decoding complexity and discuss possible binary implementation.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Soljanin\"],\"firstnames\":[\"E.\"],\"suffixes\":[]}],\"journal\":\"ICC\",\"tags\":\"network_coding\",\"title\":\"A Connection between Network Coding and Convolutional Codes\",\"year\":\"2004\",\"bibtex\":\"@article{fragouli_connection_2004,\\n abstract = {The min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by liner re-encoding at nodes in communications networks, the min-cut rate can be also achieved in multicasting to several sinks. In this paper we discuss connections between such coding schemes and convolutional codes. We propose a method to simplify the convolutionalencoder design that is based on a subtree decompositionof the network line graph, describe the structure of the associated matrices, investigate methods to reduce decoding complexity and discuss possible binary implementation.},\\n type={4},\\n author = {Fragouli, C. and Soljanin, E.},\\n journal = {ICC},\\n tags = {network_coding},\\n title = {A {Connection} between {Network} {Coding} and {Convolutional} {Codes}},\\n year = {2004}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Soljanin, E.\"],\"key\":\"fragouli_connection_2004\",\"id\":\"fragouli_connection_2004\",\"bibbaseid\":\"fragouli-soljanin-aconnectionbetweennetworkcodingandconvolutionalcodes-2004\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wesel\"],\"firstnames\":[\"R.\",\"D.\"],\"suffixes\":[]}],\"journal\":\"Proceedings of the 7th International Conference on Advances in Communications and Control, June 28-July 2, Athens, Greece.\",\"tags\":\"channel_coding\",\"title\":\"Convolutional codes and matrix control theory\",\"year\":\"1999\",\"bibtex\":\"@article{fragouli_convolutional_1999,\\n type={4},\\n author = {Fragouli, C. and Wesel, R. D.},\\n journal = {Proceedings of the 7th International Conference on Advances in Communications and Control, June 28-July 2, Athens, Greece.},\\n tags = {channel_coding},\\n title = {Convolutional codes and matrix control theory},\\n year = {1999}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Wesel, R. D.\"],\"key\":\"fragouli_convolutional_1999\",\"id\":\"fragouli_convolutional_1999\",\"bibbaseid\":\"fragouli-wesel-convolutionalcodesandmatrixcontroltheory-1999\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"This paper proposes deterministic algorithms for decentralized network coding. Decentralized coding allows to locally specify the coding operations at network nodes without knowledge of the overall network topology, and to accommodate future changes in the network such as addition of receivers. To the best of our knowledge, these are the first deterministic decentralized algorithms proposed for network coding.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Soljanin\"],\"firstnames\":[\"E.\"],\"suffixes\":[]}],\"journal\":\"Information Theory Workshop\",\"tags\":\"network_coding\",\"title\":\"Decentralized Network Coding\",\"year\":\"2004\",\"bibtex\":\"@article{fragouli_decentralized_2004,\\n abstract = {This paper proposes deterministic algorithms for decentralized network coding. Decentralized coding allows to locally specify the coding operations at network nodes without knowledge of the overall network topology, and to accommodate future changes in the network such as addition of receivers. To the best of our knowledge, these are the first deterministic decentralized algorithms proposed for network coding.},\\n type={4},\\n author = {Fragouli, C. and Soljanin, E.},\\n journal = {Information Theory Workshop},\\n tags = {network_coding},\\n title = {Decentralized {Network} {Coding}},\\n year = {2004}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Soljanin, E.\"],\"key\":\"fragouli_decentralized_2004\",\"id\":\"fragouli_decentralized_2004\",\"bibbaseid\":\"fragouli-soljanin-decentralizednetworkcoding-2004\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"The determinant and rank criteria used for space-time code design apply at high SNR. Code design metrics developed for low SNR assume a channel autocorrelation matrix with equal eigenvalues, which does not hold in many practical scenarios. This paper shows that a space-time code designed to ensure full diversity at high SNR can suffer significant degradation when implemented at low-to-medium SNR because of the channel autocorrelation profile. We examine the effect of the channel autocorrelation matrix on a space-time code's performance and discuss how knowledge of this matrix can be used for code design, particularly from the aspect of space-time trellis code minimum memory requirements. Our discussion applies to both flat-fading and frequency-selective channels that are treated in a unified manner.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Al-Dhahir\"],\"firstnames\":[\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Turin\"],\"firstnames\":[\"W.\"],\"suffixes\":[]}],\"journal\":\"ICC 2002, NY\",\"pages\":\"pages 826–830\",\"tags\":\"wireless,channel_coding\",\"title\":\"Effect of Spatio-Temporal Channel Correlation on the Performance of Space-Time Codes\",\"volume\":\"vol. 2\",\"year\":\"2002\",\"bibtex\":\"@article{fragouli_effect_2002,\\n abstract = {The determinant and rank criteria used for space-time code design apply at high SNR. Code design metrics developed for low SNR assume a channel autocorrelation matrix with equal eigenvalues, which does not hold in many practical scenarios. This paper shows that a space-time code designed to ensure full diversity at high SNR can suffer significant degradation when implemented at low-to-medium SNR because of the channel autocorrelation profile. We examine the effect of the channel autocorrelation matrix on a space-time code's performance and discuss how knowledge of this matrix can be used for code design, particularly from the aspect of space-time trellis code minimum memory requirements. Our discussion applies to both flat-fading and frequency-selective channels that are treated in a unified manner.},\\n type={4},\\n author = {Fragouli, C. and Al-Dhahir, N. and Turin, W.},\\n journal = {ICC 2002, NY},\\n pages = {pages 826--830},\\n tags = {wireless,channel_coding},\\n title = {Effect of {Spatio}-{Temporal} {Channel} {Correlation} on the {Performance} of {Space}-{Time} {Codes}},\\n volume = {vol. 2},\\n year = {2002}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Al-Dhahir, N.\",\"Turin, W.\"],\"key\":\"fragouli_effect_2002\",\"id\":\"fragouli_effect_2002\",\"bibbaseid\":\"fragouli-aldhahir-turin-effectofspatiotemporalchannelcorrelationontheperformanceofspacetimecodes-2002\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"We consider the problem of broadcasting in an ad hoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless networks since it directly affects battery life and thus network lifetime. We prove that applying ideas from network coding allows to realize significant benefits in terms of energy efficiency for the problem of broadcasting, and propose very simple algorithms that allow to realize these benefits in practice. In particular, our theoretical analysis shows that network coding improves performance by a constant factor in fixed networks. We calculate this factor exactly for some canonical configurations. We then show that in networks where the topology dynamically changes, for example due to mobility, and where operations are restricted to simple distributed algorithms, network coding can offer improvements of a factor of , where is the number of nodes in the network. We use the insights gained from the theoretical analysis to propose low-complexity distributed algorithms for realistic wireless ad hoc scenarios, discuss a number of practical considerations, and evaluate our algorithms through packet level simulation.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Widmer\"],\"firstnames\":[\"J.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Le\",\"Boudec\"],\"firstnames\":[\"J.-Y.\"],\"suffixes\":[]}],\"journal\":\"IEEE/ACM Transactions on Networking\",\"pages\":\"450–463\",\"tags\":\"network_coding,wireless\",\"title\":\"Efficient broadcasting using network coding\",\"volume\":\"16\",\"year\":\"2008\",\"bibtex\":\"@article{fragouli_efficient_2008,\\n abstract = {We consider the problem of broadcasting in an ad hoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless networks since it directly affects battery life and thus network lifetime. We prove that applying ideas from network coding allows to realize significant benefits in terms of energy efficiency for the problem of broadcasting, and propose very simple algorithms that allow to realize these benefits in practice. In particular, our theoretical analysis shows that network coding improves performance by a constant factor in fixed networks. We calculate this factor exactly for some canonical configurations. We then show that in networks where the topology dynamically changes, for example due to mobility, and where operations are restricted to simple distributed algorithms, network coding can offer improvements of a factor of , where is the number of nodes in the network. We use the insights gained from the theoretical analysis to propose low-complexity distributed algorithms for realistic wireless ad hoc scenarios, discuss a number of practical considerations, and evaluate our algorithms through packet level simulation.},\\n type={2},\\n author = {Fragouli, C. and Widmer, J. and Le Boudec, J.-Y.},\\n journal = {IEEE/ACM Transactions on Networking},\\n pages = {450--463},\\n tags = {network_coding,wireless},\\n title = {Efficient broadcasting using network coding},\\n volume = {16},\\n year = {2008}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Widmer, J.\",\"Le Boudec, J.\"],\"key\":\"fragouli_efficient_2008\",\"id\":\"fragouli_efficient_2008\",\"bibbaseid\":\"fragouli-widmer-leboudec-efficientbroadcastingusingnetworkcoding-2008\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Lun\"],\"firstnames\":[\"Desmond\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Médard\"],\"firstnames\":[\"Muriel\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Pakzad\"],\"firstnames\":[\"Payam\"],\"suffixes\":[]}],\"booktitle\":\"in Proc. of 2007 Conference on Information Sciences and Systems (CISS)\",\"tags\":\"network_coding\",\"title\":\"On feedback for network coding\",\"year\":\"2007\",\"bibtex\":\"@inproceedings{fragouli_feedback_2007,\\n type={4},\\n author = {Fragouli, C. and Lun, Desmond and Médard, Muriel and Pakzad, Payam},\\n booktitle = {in {Proc}. of 2007 {Conference} on {Information} {Sciences} and {Systems} ({CISS})},\\n tags = {network_coding},\\n title = {On feedback for network coding},\\n year = {2007}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Lun, D.\",\"Médard, M.\",\"Pakzad, P.\"],\"key\":\"fragouli_feedback_2007\",\"id\":\"fragouli_feedback_2007\",\"bibbaseid\":\"fragouli-lun-mdard-pakzad-onfeedbackfornetworkcoding-2007\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"We propose a method to identify training sequences for multiple-antenna transmissions over quasi-static frequency-selective channels. These sequences are constructed to belong to a standard constant-amplitude 2m-PSK constellation (such as BPSK, QPSK etc) to simplify the transmitter/receiver implementation. Many practical systems use training of predetermined length. Optimal sequences do not exist for all training sequence lengths and constellation alphabets. The proposed method allows us to identify training sequences that belong to a standard constellation for an arbitrary training sequence length and an arbitrary number of unknown channel taps. Performance bounds derived indicate that these sequences achieve near-optimum performance.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Al-Dhahir\"],\"firstnames\":[\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Turin\"],\"firstnames\":[\"W.\"],\"suffixes\":[]}],\"journal\":\"ICC 2002, NY\",\"pages\":\"pages 6–10\",\"tags\":\"wireless,channel_coding\",\"title\":\"Finite-Alphabet Constant-Amplitude Training Sequences for Multiple-Antennas\",\"volume\":\"vol. 25, no. 1\",\"year\":\"2002\",\"bibtex\":\"@article{fragouli_finite-alphabet_2002,\\n abstract = {We propose a method to identify training sequences for multiple-antenna transmissions over quasi-static frequency-selective channels. These sequences are constructed to belong to a standard constant-amplitude 2m-PSK constellation (such as BPSK, QPSK etc) to simplify the transmitter/receiver implementation. Many practical systems use training of predetermined length. Optimal sequences do not exist for all training sequence lengths and constellation alphabets. The proposed method allows us to identify training sequences that belong to a standard constellation for an arbitrary training sequence length and an arbitrary number of unknown channel taps. Performance bounds derived indicate that these sequences achieve near-optimum performance.},\\n type={4},\\n author = {Fragouli, C. and Al-Dhahir, N. and Turin, W.},\\n journal = {ICC 2002, NY},\\n pages = {pages 6--10},\\n tags = {wireless,channel_coding},\\n title = {Finite-{Alphabet} {Constant}-{Amplitude} {Training} {Sequences} for {Multiple}-{Antennas}},\\n volume = {vol. 25, no. 1},\\n year = {2002}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Al-Dhahir, N.\",\"Turin, W.\"],\"key\":\"fragouli_finite-alphabet_2002\",\"id\":\"fragouli_finite-alphabet_2002\",\"bibbaseid\":\"fragouli-aldhahir-turin-finitealphabetconstantamplitudetrainingsequencesformultipleantennas-2002\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"The famous min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by linear re-encoding at nodes in communications networks, the min-cut rate can be also achieved in multicasting to several sinks. Constructing such coding schemes efficiently is the subject of current research. The main idea in this paper is the identification of structural properties of multicast configurations, by decompositing the information flows into a minimal number of subtrees. This decomposition allows us to show that very different networks are equivalent from the coding point of view, and offers a method to identify such equivalence classes. It also allows us to divide the network coding problem into two almost independent problems: one of graph theory and the other of classical channel coding theory. This approach to network coding enables us to derive tight bounds on the network code alphabet size and calculate the throughput improvement network coding can offer for different configurations. But perhaps the most significant strength of our approach concerns future network coding practice. Namely, we propose algorithms to specify the coding operations at network nodes without the knowledge of the overall network topology. Such decentralized designs facilitate the construction of codes which can easily accommodate future changes in the network, e.g., addition of receivers and loss of links.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Soljanin\"],\"firstnames\":[\"E.\"],\"suffixes\":[]}],\"journal\":\"IEEE Trans. Inform. Theory\",\"tags\":\"network_coding\",\"title\":\"Information Flow Decomposition for Network Coding\",\"year\":\"2006\",\"bibtex\":\"@article{fragouli_information_2006,\\n abstract = {The famous min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by linear re-encoding at nodes in communications networks, the min-cut rate can be also achieved in multicasting to several sinks. Constructing such coding schemes efficiently is the subject of current research. The main idea in this paper is the identification of structural properties of multicast configurations, by decompositing the information flows into a minimal number of subtrees. This decomposition allows us to show that very different networks are equivalent from the coding point of view, and offers a method to identify such equivalence classes. It also allows us to divide the network coding problem into two almost independent problems: one of graph theory and the other of classical channel coding theory. This approach to network coding enables us to derive tight bounds on the network code alphabet size and calculate the throughput improvement network coding can offer for different configurations. But perhaps the most significant strength of our approach concerns future network coding practice. Namely, we propose algorithms to specify the coding operations at network nodes without the knowledge of the overall network topology. Such decentralized designs facilitate the construction of codes which can easily accommodate future changes in the network, e.g., addition of receivers and loss of links.},\\n type={4},\\n author = {Fragouli, C. and Soljanin, E.},\\n journal = {IEEE Trans. Inform. Theory},\\n tags = {network_coding},\\n title = {Information {Flow} {Decomposition} for {Network} {Coding}},\\n year = {2006}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Soljanin, E.\"],\"key\":\"fragouli_information_2006\",\"id\":\"fragouli_information_2006\",\"bibbaseid\":\"fragouli-soljanin-informationflowdecompositionfornetworkcoding-2006\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"This paper investigates encoders optimization for the Hamming weight after periodic puncturing, and discusses minimality issues that may affect the performance of the punctured encoders. Periodically puncturing a minimal encoder produces a higher rate encoder that may or may not be minimal. If it is not minimal, it may have a zero-output loop and it may be catastrophic. A code search can use a fast algorithm to determine whether an encoder's state diagram has a zero-output loop under periodic symbol puncturing, and a proposed method to assess the performance of codes with a zero-output loop that are not catastrophic. As an example, the paper optimizes rate-1/4 unpunctured codes for Hamming weight under both bit-wise and symbol-wise periodic puncturing. Code tables and simulation results are included.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Komninakis\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wesel\"],\"firstnames\":[\"R.\",\"D.\"],\"suffixes\":[]}],\"journal\":\"ICC 2001, Helsinki, Finland, June\",\"pages\":\"pages 300–304\",\"tags\":\"channel_coding\",\"title\":\"Minimality for puncturing convolutional codes\",\"volume\":\"vol. 1\",\"year\":\"2001\",\"bibtex\":\"@article{fragouli_minimality_2001,\\n abstract = {This paper investigates encoders optimization for the Hamming weight after periodic puncturing, and discusses minimality issues that may affect the performance of the punctured encoders. Periodically puncturing a minimal encoder produces a higher rate encoder that may or may not be minimal. If it is not minimal, it may have a zero-output loop and it may be catastrophic. A code search can use a fast algorithm to determine whether an encoder's state diagram has a zero-output loop under periodic symbol puncturing, and a proposed method to assess the performance of codes with a zero-output loop that are not catastrophic. As an example, the paper optimizes rate-1/4 unpunctured codes for Hamming weight under both bit-wise and symbol-wise periodic puncturing. Code tables and simulation results are included.},\\n type={4},\\n author = {Fragouli, C. and Komninakis, C. and Wesel, R. D.},\\n journal = {ICC 2001, Helsinki, Finland, June},\\n pages = {pages 300--304},\\n tags = {channel_coding},\\n title = {Minimality for puncturing convolutional codes},\\n volume = {vol. 1},\\n year = {2001}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Komninakis, C.\",\"Wesel, R. D.\"],\"key\":\"fragouli_minimality_2001\",\"id\":\"fragouli_minimality_2001\",\"bibbaseid\":\"fragouli-komninakis-wesel-minimalityforpuncturingconvolutionalcodes-2001\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"incollection\",\"type\":\"4\",\"abstract\":\"Balancing energy efficiency and reliability is a common underlying goal for most information collection protocols in sensor networks. Multipath diversity has emerged as one of the promising techniques to achieve such a balance. In this chapter, we provide a unified framework for the multipath techniques in the literature and discuss their basic benefits and drawbacks. We also discuss emerging techniques from the area of network coding.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Argyraki\"],\"firstnames\":[\"K.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Keller\"],\"firstnames\":[\"L.\"],\"suffixes\":[]}],\"booktitle\":\"Sensor Networks\",\"pages\":\"75–99\",\"publisher\":\"Springer\",\"tags\":\"sensor_networks\",\"title\":\"Multipath Diversity and Robustness for Sensor Networks\",\"year\":\"2009\",\"bibtex\":\"@incollection{fragouli_multipath_2009,\\n abstract = {Balancing energy efficiency and reliability is a common underlying goal for most information collection protocols in sensor networks. Multipath diversity has emerged as one of the promising techniques to achieve such a balance. In this chapter, we provide a unified framework for the multipath techniques in the literature and discuss their basic benefits and drawbacks. We also discuss emerging techniques from the area of network coding.},\\n type={4},\\n author = {Fragouli, C. and Argyraki, K. and Keller, L.},\\n booktitle = {Sensor {Networks}},\\n pages = {75--99},\\n publisher = {Springer},\\n tags = {sensor_networks},\\n title = {Multipath {Diversity} and {Robustness} for {Sensor} {Networks}},\\n year = {2009}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Argyraki, K.\",\"Keller, L.\"],\"key\":\"fragouli_multipath_2009\",\"id\":\"fragouli_multipath_2009\",\"bibbaseid\":\"fragouli-argyraki-keller-multipathdiversityandrobustnessforsensornetworks-2009\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"We consider a multicast configuration with two sources, and translate the network code design problem to vertex coloring of an appropriately defined graph. This observation enables to derive code design algorithms and alphabet size bounds, as well as establish a connection with a number of well-known results from discrete mathematics that increase our insight in the different trade-offs possible for network coding.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Soljanin\"],\"firstnames\":[\"E.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Shokrollahi\"],\"firstnames\":[\"A.\"],\"suffixes\":[]}],\"journal\":\"CISS\",\"tags\":\"network_coding\",\"title\":\"Network Coding as a Coloring Problem\",\"year\":\"2004\",\"bibtex\":\"@article{fragouli_network_2004,\\n abstract = {We consider a multicast configuration with two sources, and translate the network code design problem to vertex coloring of an appropriately defined graph. This observation enables to derive code design algorithms and alphabet size bounds, as well as establish a connection with a number of well-known results from discrete mathematics that increase our insight in the different trade-offs possible for network coding.},\\n type={4},\\n author = {Fragouli, C. and Soljanin, E. and Shokrollahi, A.},\\n journal = {CISS},\\n tags = {network_coding},\\n title = {Network {Coding} as a {Coloring} {Problem}},\\n year = {2004}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Soljanin, E.\",\"Shokrollahi, A.\"],\"key\":\"fragouli_network_2004\",\"id\":\"fragouli_network_2004\",\"bibbaseid\":\"fragouli-soljanin-shokrollahi-networkcodingasacoloringproblem-2004\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"Network Monitoring is a challenging problem that has received a lot of attention in the Internet community, particularly in the context of overlay networks. Independently, recent advances in Network Coding have shown that it is possible to increase network capacity and better share the available resources by allowing intermediate nodes to perform processing operations, in addition to just forwarding packets. In this work, we propose the use of Network Coding techniques to improve Network Monitoring. As a specific application, we use our approach for the well-known problem of network tomography, and in particular for inferring link loss rates from end-to-end measurements. We demonstrate that our approach can decrease the bandwidth used by probes, improve the accuracy of estimation, and decrease the complexity of selecting paths or trees to send probes. Overall, we argue that the use of Network Coding techniques shows great promise for improving several aspects of monitoring in overlay networks.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Markopoulou\"],\"firstnames\":[\"Athina\"],\"suffixes\":[]}],\"journal\":\"Allerton\",\"tags\":\"network_coding\",\"title\":\"A Network Coding Approach to Network Monitoring\",\"year\":\"2005\",\"bibtex\":\"@article{fragouli_network_2005,\\n abstract = {Network Monitoring is a challenging problem that has received a lot of attention in the Internet community, particularly in the context of overlay networks. Independently, recent advances in Network Coding have shown that it is possible to increase network capacity and better share the available resources by allowing intermediate nodes to perform processing operations, in addition to just forwarding packets. In this work, we propose the use of Network Coding techniques to improve Network Monitoring. As a specific application, we use our approach for the well-known problem of network tomography, and in particular for inferring link loss rates from end-to-end measurements. We demonstrate that our approach can decrease the bandwidth used by probes, improve the accuracy of estimation, and decrease the complexity of selecting paths or trees to send probes. Overall, we argue that the use of Network Coding techniques shows great promise for improving several aspects of monitoring in overlay networks.},\\n type={4},\\n author = {Fragouli, C. and Markopoulou, Athina},\\n journal = {Allerton},\\n tags = {network_coding},\\n title = {A {Network} {Coding} {Approach} to {Network} {Monitoring}},\\n year = {2005}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Markopoulou, A.\"],\"key\":\"fragouli_network_2005\",\"id\":\"fragouli_network_2005\",\"bibbaseid\":\"fragouli-markopoulou-anetworkcodingapproachtonetworkmonitoring-2005\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"We show that network coding allows to realize significant energy savings in a wireless ad-hoc network, when each node of the network is a source that wants to transmit information to all other nodes. Energy efficiency directly affects battery life and thus is a critical design parameter for wireless ad-hoc networks. We propose an implementable method for performing network coding in such a setting. We analyze theoretical cases in detail, and use the insights gained to propose a practical, fully distributed method for realistic wireless ad-hoc scenarios. We address practical issues such as setting the forwarding factor, managing generations, and impact of transmission range. We use theoretical analysis and packet level simulation.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Widmer\"],\"firstnames\":[\"J.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Le\",\"Boudec\"],\"firstnames\":[\"J.-Y.\"],\"suffixes\":[]}],\"journal\":\"Infocom\",\"tags\":\"network_coding,wireless\",\"title\":\"A Network Coding Approach to Energy Efficient Broadcasting: from Theory to Practice\",\"year\":\"2006\",\"bibtex\":\"@article{fragouli_network_2006,\\n abstract = {We show that network coding allows to realize significant energy savings in a wireless ad-hoc network, when each node of the network is a source that wants to transmit information to all other nodes. Energy efficiency directly affects battery life and thus is a critical design parameter for wireless ad-hoc networks. We propose an implementable method for performing network coding in such a setting. We analyze theoretical cases in detail, and use the insights gained to propose a practical, fully distributed method for realistic wireless ad-hoc scenarios. We address practical issues such as setting the forwarding factor, managing generations, and impact of transmission range. We use theoretical analysis and packet level simulation.},\\n type={4},\\n author = {Fragouli, C. and Widmer, J. and Le Boudec, J.-Y.},\\n journal = {Infocom},\\n tags = {network_coding,wireless},\\n title = {A {Network} {Coding} {Approach} to {Energy} {Efficient} {Broadcasting}: from {Theory} to {Practice}},\\n year = {2006}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Widmer, J.\",\"Le Boudec, J.\"],\"key\":\"fragouli_network_2006\",\"id\":\"fragouli_network_2006\",\"bibbaseid\":\"fragouli-widmer-leboudec-anetworkcodingapproachtoenergyefficientbroadcastingfromtheorytopractice-2006\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"5\",\"abstract\":\"Network coding is a new research area that may have interesting applications in practical networking systems. With network coding, intermediate nodes may send out packets that are linear combinations of previously received information. There are two main benefits of this approach: potential throughput improvements and a high degree of robustness. Robustness translates into loss resilience and facilitates the design of simple distributed algorithms that perform well, even if decisions are based only on partial information. This paper is an instant primer on network coding: we explain what network coding does and how it does it. We also discuss the implications of theoretical results on network coding for realistic settings and show how network coding can be used in practice.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Widmer\"],\"firstnames\":[\"J.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Le\",\"Boudec\"],\"firstnames\":[\"J.-Y.\"],\"suffixes\":[]}],\"journal\":\"ACM SIGCOM Computer Communication Review\",\"tags\":\"network_coding\",\"title\":\"Network coding: an instant primer\",\"year\":\"2006\",\"bibtex\":\"@article{fragouli_network_2006-1,\\n abstract = {Network coding is a new research area that may have interesting applications in practical networking systems. With network coding, intermediate nodes may send out packets that are linear combinations of previously received information. There are two main benefits of this approach: potential throughput improvements and a high degree of robustness. Robustness translates into loss resilience and facilitates the design of simple distributed algorithms that perform well, even if decisions are based only on partial information. This paper is an instant primer on network coding: we explain what network coding does and how it does it. We also discuss the implications of theoretical results on network coding for realistic settings and show how network coding can be used in practice.},\\n type={5},\\n author = {Fragouli, C. and Widmer, J. and Le Boudec, J.-Y.},\\n journal = {ACM SIGCOM Computer Communication Review},\\n tags = {network_coding},\\n title = {Network coding: an instant primer},\\n year = {2006}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Widmer, J.\",\"Le Boudec, J.\"],\"key\":\"fragouli_network_2006-1\",\"id\":\"fragouli_network_2006-1\",\"bibbaseid\":\"fragouli-widmer-leboudec-networkcodinganinstantprimer-2006\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"End-to-end active network monitoring infers network characteristics by sending and collecting probe packets from the network edge, while probes traverse the network through multicast trees or a mesh of unicast paths. Most reported methods consider given source and receiver locations and study the path selection and the associated estimation algorithms. In this paper, we show that appropriately choosing the number of sources and receivers, as well as their location, may have a significant effect on the accuracy of the estimation; we also give guidelines on how to choose the best “points of view” of a network for link loss monitoring purposes. Though this observation applies across all monitoring methods, we consider, in particular, networks where nodes are equipped with network coding capabilities; our framework includes as special cases the scenarios of pure multicast and network coding. We show that, in network-coding enabled networks, multiple source active monitoring can exploit these capabilities to estimate link loss rates more efficiently than purely tomographic methods. To address the complexity of the estimation problem for large networks, we also propose efficient algorithms, including the decomposition into smaller multicast inference problems, belief-propagation, and a MINC-like algorithm.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Markopoulou\"],\"firstnames\":[\"Athina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Srinivasan\"],\"firstnames\":[\"R.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]}],\"journal\":\"ITA\",\"tags\":\"network_coding\",\"title\":\"Network monitoring: it depends on your points of view\",\"year\":\"2007\",\"bibtex\":\"@article{fragouli_network_2007,\\n abstract = {End-to-end active network monitoring infers network characteristics by sending and collecting probe packets from the network edge, while probes traverse the network through multicast trees or a mesh of unicast paths. Most reported methods consider given source and receiver locations and study the path selection and the associated estimation algorithms. In this paper, we show that appropriately choosing the number of sources and receivers, as well as their location, may have a significant effect on the accuracy of the estimation; we also give guidelines on how to choose the best “points of view” of a network for link loss monitoring purposes. Though this observation applies across all monitoring methods, we consider, in particular, networks where nodes are equipped with network coding capabilities; our framework includes as special cases the scenarios of pure multicast and network coding. We show that, in network-coding enabled networks, multiple source active monitoring can exploit these capabilities to estimate link loss rates more efficiently than purely tomographic methods. To address the complexity of the estimation problem for large networks, we also propose efficient algorithms, including the decomposition into smaller multicast inference problems, belief-propagation, and a MINC-like algorithm.},\\n type={4},\\n author = {Fragouli, C. and Markopoulou, Athina and Srinivasan, R. and Diggavi, Suhas N.},\\n journal = {ITA},\\n tags = {network_coding},\\n title = {Network monitoring: it depends on your points of view},\\n year = {2007}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Markopoulou, A.\",\"Srinivasan, R.\",\"Diggavi, S. N.\"],\"key\":\"fragouli_network_2007\",\"id\":\"fragouli_network_2007\",\"bibbaseid\":\"fragouli-markopoulou-srinivasan-diggavi-networkmonitoringitdependsonyourpointsofview-2007\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"book\",\"type\":\"5\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Soljanin\"],\"firstnames\":[\"E.\"],\"suffixes\":[]}],\"publisher\":\"Now Publisher\",\"series\":\"Foundations and Trends in Networking\",\"tags\":\"network_coding\",\"title\":\"Network coding: Fundamentals and Applications\",\"volume\":\"1\",\"year\":\"2007\",\"bibtex\":\"@book{fragouli_network_2007-1,\\n type={5},\\n author = {Fragouli, C. and Soljanin, E.},\\n publisher = {Now Publisher},\\n series = {Foundations and {Trends} in {Networking}},\\n tags = {network_coding},\\n title = {Network coding: {Fundamentals} and {Applications}},\\n volume = {1},\\n year = {2007}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Soljanin, E.\"],\"key\":\"fragouli_network_2007-1\",\"id\":\"fragouli_network_2007-1\",\"bibbaseid\":\"fragouli-soljanin-networkcodingfundamentalsandapplications-2007\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"We here advocate the case for network coding as a guiding paradigm for the operation of networks that vary in a small time frame, due to node mobility, channel variations, and varying traffic conditions. Three ideas that appeared succesively in time brought in place an elegant operation for network coding in such environments. These are, use of randomized network coding for intermediate node operation, use of generations to avoid synchronization, and use of subspace coding to allow for small packet sizes. Information theoretical performance limits support these results.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"IEEE International Wireless Communications and Mobile Computing Conference\",\"tags\":\"network_coding,wireless\",\"title\":\"Network coding for dynamically changing networks\",\"year\":\"2008\",\"bibtex\":\"@article{fragouli_network_2008,\\n abstract = {We here advocate the case for network coding as a guiding paradigm for the operation of networks that vary in a small time frame, due to node mobility, channel variations, and varying traffic conditions. Three ideas that appeared succesively in time brought in place an elegant operation for network coding in such environments. These are, use of randomized network coding for intermediate node operation, use of generations to avoid synchronization, and use of subspace coding to allow for small packet sizes. Information theoretical performance limits support these results.},\\n type={4},\\n author = {Fragouli, C.},\\n journal = {IEEE International Wireless Communications and Mobile Computing Conference},\\n tags = {network_coding,wireless},\\n title = {Network coding for dynamically changing networks},\\n year = {2008}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\"],\"key\":\"fragouli_network_2008\",\"id\":\"fragouli_network_2008\",\"bibbaseid\":\"fragouli-networkcodingfordynamicallychangingnetworks-2008\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Markopoulou\"],\"firstnames\":[\"Athina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Gjoka\"],\"firstnames\":[\"M.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"month\":\"January\",\"tags\":\"wireless\",\"title\":\"A network coding approach to network tomography\",\"year\":\"2009\",\"bibtex\":\"@article{fragouli_network_2009,\\n type={2},\\n author = {Fragouli, C. and Markopoulou, Athina and Gjoka, M.},\\n journal = {IEEE Transactions on Information Theory},\\n month = {January},\\n tags = {wireless},\\n title = {A network coding approach to network tomography},\\n year = {2009}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Markopoulou, A.\",\"Gjoka, M.\"],\"key\":\"fragouli_network_2009\",\"id\":\"fragouli_network_2009\",\"bibbaseid\":\"fragouli-markopoulou-gjoka-anetworkcodingapproachtonetworktomography-2009\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"Special Issue on Network Coding at the Proceedings of the IEEE\",\"tags\":\"network_coding\",\"title\":\"Network coding: beyond throughput benefits\",\"year\":\"2011\",\"bibtex\":\"@article{fragouli_network_2011,\\n type={2},\\n author = {Fragouli, C.},\\n journal = {Special Issue on Network Coding at the Proceedings of the IEEE},\\n tags = {network_coding},\\n title = {Network coding: beyond throughput benefits},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\"],\"key\":\"fragouli_network_2011\",\"id\":\"fragouli_network_2011\",\"bibbaseid\":\"fragouli-networkcodingbeyondthroughputbenefits-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"doi\":\"10.1504/ijaacs.2009.024280\",\"issn\":\"1754-8632\",\"journal\":\"Int. J. Auton. Adapt. Commun. Syst.\",\"note\":\"Place: Inderscience Publishers, Geneva, SWITZERLAND Publisher: Inderscience Publishers\",\"number\":\"1\",\"pages\":\"1–23\",\"tags\":\"network_coding,wireless\",\"title\":\"An overview of network coding for dynamically changing networks\",\"volume\":\"2\",\"year\":\"2009\",\"bibtex\":\"@article{fragouli_overview_2009,\\n type={4},\\n author = {Fragouli, C.},\\n doi = {10.1504/ijaacs.2009.024280},\\n issn = {1754-8632},\\n journal = {Int. J. Auton. Adapt. Commun. Syst.},\\n note = {Place: Inderscience Publishers, Geneva, SWITZERLAND\\nPublisher: Inderscience Publishers},\\n number = {1},\\n pages = {1--23},\\n tags = {network_coding,wireless},\\n title = {An overview of network coding for dynamically changing networks},\\n volume = {2},\\n year = {2009}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\"],\"key\":\"fragouli_overview_2009\",\"id\":\"fragouli_overview_2009\",\"bibbaseid\":\"fragouli-anoverviewofnetworkcodingfordynamicallychangingnetworks-2009\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"This paper addresses the problem of soft equalization for time-variant frequency-selective channels. Such a channel arises in EDGE (Enhanced Data for GSM Evolution), third generation TDMA proposal, which employs 8-PSK modulation with a linearized GMSK pulse shaping filter that introduces strong intersymbol interference. The proposed equalization approach uses a prefilter to concetrate the effective channel power in a small number of taps, followed by a reduced complexity MAP equalizer to produce soft decision outputs. The MAP equalizer is based on the implementation of the M-algorithm in the log domain. The prefilter introduces residual intersymbol interference which degrades the performance of MAP when applied to the trellis of the shortened channel. However, the shape of the overall shortened channel impulse response allows the M-algorithm to approximate the prefiltered MAP performance with a small number of states. Based on this general framework, we investigate several enhancements, such as using a different prefilter for the forward and backward recursion, concatenating two trellis steps during decoding, and temporal oversampling. The performance is evaluated through simulations over the typical urban (TU) EDGE channel.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Al-Dhahir\"],\"firstnames\":[\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Turin\"],\"firstnames\":[\"W.\"],\"suffixes\":[]}],\"journal\":\"CISS\",\"tags\":\"channel_coding\",\"title\":\"Prefiltered space-Time M-BCJR Equalizer for MIMO Frequency-Selective Channels\",\"year\":\"2001\",\"bibtex\":\"@article{fragouli_prefiltered_2001,\\n abstract = {This paper addresses the problem of soft equalization for time-variant frequency-selective channels. Such a channel arises in EDGE (Enhanced Data for GSM Evolution), third generation TDMA proposal, which employs 8-PSK modulation with a linearized GMSK pulse shaping filter that introduces strong intersymbol interference. The proposed equalization approach uses a prefilter to concetrate the effective channel power in a small number of taps, followed by a reduced complexity MAP equalizer to produce soft decision outputs. The MAP equalizer is based on the implementation of the M-algorithm in the log domain. The prefilter introduces residual intersymbol interference which degrades the performance of MAP when applied to the trellis of the shortened channel. However, the shape of the overall shortened channel impulse response allows the M-algorithm to approximate the prefiltered MAP performance with a small number of states. Based on this general framework, we investigate several enhancements, such as using a different prefilter for the forward and backward recursion, concatenating two trellis steps during decoding, and temporal oversampling. The performance is evaluated through simulations over the typical urban (TU) EDGE channel.},\\n type={4},\\n author = {Fragouli, C. and Al-Dhahir, N. and Diggavi, Suhas N. and Turin, W.},\\n journal = {CISS},\\n tags = {channel_coding},\\n title = {Prefiltered space-{Time} {M}-{BCJR} {Equalizer} for {MIMO} {Frequency}-{Selective} {Channels}},\\n year = {2001}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Al-Dhahir, N.\",\"Diggavi, S. N.\",\"Turin, W.\"],\"key\":\"fragouli_prefiltered_2001\",\"id\":\"fragouli_prefiltered_2001\",\"bibbaseid\":\"fragouli-aldhahir-diggavi-turin-prefilteredspacetimembcjrequalizerformimofrequencyselectivechannels-2001\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"This paper addresses the problem of soft equalization for space-time-coded transmissions over frequency-selective fading channels. The structure of the space-time code is embedded in the channel impulse response for efficient joint equalization and decoding. The proposed equalization/decoding approach uses a prefilter to concentrate the effective channel power in a small number of taps followed by a reduced-complexity maximum a posteriori probability (MAP) equalizer/decoder to produce soft decisions. The prefilter introduces residual intersymbol interference which degrades the performance of MAP when applied to the trellis of the shortened channel. However, the shape of the overall shortened channel impulse response allows the M-algorithm to approximate the prefiltered MAP performance with a small number of states. Based on this general framework, we investigate several enhancements such as using different prefilters for the forward and backward recursions, concatenating two trellis steps during decoding, and temporal oversampling. The performance is evaluated through simulations over the EDGE typical urban channel.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Al-Dhahir\"],\"firstnames\":[\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Turin\"],\"firstnames\":[\"W.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Communications\",\"pages\":\"pages 742–753\",\"tags\":\"wireless,channel_coding\",\"title\":\"Prefiltered M-BCJR Equalizer for MIMO Frequency-Selective Channels\",\"volume\":\"vol. 50, no. 5\",\"year\":\"2002\",\"bibtex\":\"@article{fragouli_prefiltered_2002,\\n abstract = {This paper addresses the problem of soft equalization for space-time-coded transmissions over frequency-selective fading channels. The structure of the space-time code is embedded in the channel impulse response for efficient joint equalization and decoding. The proposed equalization/decoding approach uses a prefilter to concentrate the effective channel power in a small number of taps followed by a reduced-complexity maximum a posteriori probability (MAP) equalizer/decoder to produce soft decisions. The prefilter introduces residual intersymbol interference which degrades the performance of MAP when applied to the trellis of the shortened channel. However, the shape of the overall shortened channel impulse response allows the M-algorithm to approximate the prefiltered MAP performance with a small number of states. Based on this general framework, we investigate several enhancements such as using different prefilters for the forward and backward recursions, concatenating two trellis steps during decoding, and temporal oversampling. The performance is evaluated through simulations over the EDGE typical urban channel.},\\n type={2},\\n author = {Fragouli, C. and Al-Dhahir, N. and Diggavi, Suhas N. and Turin, W.},\\n journal = {IEEE Transactions on Communications},\\n pages = {pages 742--753},\\n tags = {wireless,channel_coding},\\n title = {Prefiltered {M}-{BCJR} {Equalizer} for {MIMO} {Frequency}-{Selective} {Channels}},\\n volume = {vol. 50, no. 5},\\n year = {2002}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Al-Dhahir, N.\",\"Diggavi, S. N.\",\"Turin, W.\"],\"key\":\"fragouli_prefiltered_2002\",\"id\":\"fragouli_prefiltered_2002\",\"bibbaseid\":\"fragouli-aldhahir-diggavi-turin-prefilteredmbcjrequalizerformimofrequencyselectivechannels-2002\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"This paper addresses the problem of training sequence design for multiple-antenna transmissions over quasi-static frequency-selective channels. As performance metric for channel estimation, mean square error is adopted. To achieve the minimum mean square error, the training sequences transmitted from the multiple antennas must have impulse-like auto-correlation and zero cross-correlation. We reduce the problem of designing multiple training sequences to the much easier and well-understood problem of designing a single training sequence with impulse-like auto-correlation. To this end, we propose to encode the training sequences with a space-time code, that may be the same or different from the space-time code that encodes the information symbols. Designing one instead of multiple training sequences reduces the search space significantly and simplifies the construction of optimal or suboptimal training sequences.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Al-Dhahir\"],\"firstnames\":[\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Turin\"],\"firstnames\":[\"W.\"],\"suffixes\":[]}],\"journal\":\"WCNC 2002\",\"pages\":\"78–83\",\"tags\":\"wireless,channel_coding\",\"title\":\"Reduced-Complexity Training Schemes for Multiple-Antenna Broadband Transmissions\",\"volume\":\"vol. 3\",\"year\":\"2002\",\"bibtex\":\"@article{fragouli_reduced-complexity_2002,\\n abstract = {This paper addresses the problem of training sequence design for multiple-antenna transmissions over quasi-static frequency-selective channels. As performance metric for channel estimation, mean square error is adopted. To achieve the minimum mean square error, the training sequences transmitted from the multiple antennas must have impulse-like auto-correlation and zero cross-correlation. We reduce the problem of designing multiple training sequences to the much easier and well-understood problem of designing a single training sequence with impulse-like auto-correlation. To this end, we propose to encode the training sequences with a space-time code, that may be the same or different from the space-time code that encodes the information symbols. Designing one instead of multiple training sequences reduces the search space significantly and simplifies the construction of optimal or suboptimal training sequences.},\\n type={4},\\n author = {Fragouli, C. and Al-Dhahir, N. and Turin, W.},\\n journal = {WCNC 2002},\\n pages = {78--83},\\n tags = {wireless,channel_coding},\\n title = {Reduced-{Complexity} {Training} {Schemes} for {Multiple}-{Antenna} {Broadband} {Transmissions}},\\n volume = {vol. 3},\\n year = {2002}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Al-Dhahir, N.\",\"Turin, W.\"],\"key\":\"fragouli_reduced-complexity_2002\",\"id\":\"fragouli_reduced-complexity_2002\",\"bibbaseid\":\"fragouli-aldhahir-turin-reducedcomplexitytrainingschemesformultipleantennabroadbandtransmissions-2002\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Seshadri\"],\"firstnames\":[\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Turin\"],\"firstnames\":[\"W.\"],\"suffixes\":[]}],\"journal\":\"Journal on Wireless Communications and Mobile Computing\",\"pages\":\"pages 397–406\",\"tags\":\"channel_coding\",\"title\":\"Reduced-trellis equalization using a variation of the M-BCJR algorithm\",\"volume\":\"vol. 1\",\"year\":\"2001\",\"bibtex\":\"@article{fragouli_reduced-trellis_2001,\\n type={2},\\n author = {Fragouli, C. and Seshadri, N. and Turin, W.},\\n journal = {Journal on Wireless Communications and Mobile Computing},\\n pages = {pages 397--406},\\n tags = {channel_coding},\\n title = {Reduced-trellis equalization using a variation of the {M}-{BCJR} algorithm},\\n volume = {vol. 1},\\n year = {2001}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Seshadri, N.\",\"Turin, W.\"],\"key\":\"fragouli_reduced-trellis_2001\",\"id\":\"fragouli_reduced-trellis_2001\",\"bibbaseid\":\"fragouli-seshadri-turin-reducedtrellisequalizationusingavariationofthembcjralgorithm-2001\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"The complexity of channel equalization using the BCJR algorithn [1] grows exponentially with the channel memory. The M-BCJR algorithm [2], provides a method for reduced-trellis channel equalization. This paper examines the algorithm performance for different finite impulse response channels, identifies pathological cases, and introduces designer choices such as the decision delay, maximum and minimum phase transformation, and selection of states used by the algorithm. Simulation results demonstrate the effect of the different parameters in the algorithm's performance.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Seshadri\"],\"firstnames\":[\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Turin\"],\"firstnames\":[\"W.\"],\"suffixes\":[]}],\"booktitle\":\"CISS\",\"month\":\"March\",\"note\":\"event-place: Boston\",\"pages\":\"1159–1163\",\"tags\":\"wireless,channel_coding\",\"title\":\"On reduced trellis equalization using the M-BCJR Algorithm\",\"volume\":\"2\",\"year\":\"2000\",\"bibtex\":\"@inproceedings{fragouli_reduced_2000,\\n abstract = {The complexity of channel equalization using the BCJR algorithn [1] grows exponentially with the channel memory. The M-BCJR algorithm [2], provides a method for reduced-trellis channel equalization. This paper examines the algorithm performance for different finite impulse response channels, identifies pathological cases, and introduces designer choices such as the decision delay, maximum and minimum phase transformation, and selection of states used by the algorithm. Simulation results demonstrate the effect of the different parameters in the algorithm's performance.},\\n type={4},\\n author = {Fragouli, C. and Seshadri, N. and Turin, W.},\\n booktitle = {{CISS}},\\n month = {March},\\n note = {event-place: Boston},\\n pages = {1159--1163},\\n tags = {wireless,channel_coding},\\n title = {On reduced trellis equalization using the {M}-{BCJR} {Algorithm}},\\n volume = {2},\\n year = {2000}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Seshadri, N.\",\"Turin, W.\"],\"key\":\"fragouli_reduced_2000\",\"id\":\"fragouli_reduced_2000\",\"bibbaseid\":\"fragouli-seshadri-turin-onreducedtrellisequalizationusingthembcjralgorithm-2000\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Soljanin\"],\"firstnames\":[\"E.\"],\"suffixes\":[]}],\"journal\":\"Designs, Codes and Cryptography, Springer Verlag\",\"tags\":\"security\",\"title\":\"(Secure) Linear network coding multicast A theoretical minimum and some open problems\",\"year\":\"2015\",\"bibtex\":\"@article{fragouli_secure_2015,\\n type={4},\\n author = {Fragouli, C. and Soljanin, E.},\\n journal = {Designs, Codes and Cryptography, Springer Verlag},\\n tags = {security},\\n title = {({Secure}) {Linear} network coding multicast {A} theoretical minimum and some open problems},\\n year = {2015}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Soljanin, E.\"],\"key\":\"fragouli_secure_2015\",\"id\":\"fragouli_secure_2015\",\"bibbaseid\":\"fragouli-soljanin-securelinearnetworkcodingmulticastatheoreticalminimumandsomeopenproblems-2015\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"A spread interleaver of length N is a semi-random interleaver based on the random selection without replacement of N integers from 1 to N under a design constraint. This paper extends the spread-interleaver design method to multiple error events, based on the interleaver's role in overall turbo code error event distances. The extension helps to explain why the spread interleaver is specifically designed to be semi-random. Simulation results show the performance achieved for a symbol-interleaved parallel concatenated trellis coded modulation (PCTCM) scheme.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wesel\"],\"firstnames\":[\"R.\",\"D.\"],\"suffixes\":[]}],\"journal\":\"Communication Theory Symposium at Globecom 99, Rio de Janeiro, Brazil, December 5-9\",\"pages\":\"pages 2352–2356\",\"tags\":\"channel_coding\",\"title\":\"Semi-random interleaver design criteria\",\"volume\":\"5\",\"year\":\"1999\",\"bibtex\":\"@article{fragouli_semi-random_1999,\\n abstract = {A spread interleaver of length N is a semi-random interleaver based on the random selection without replacement of N integers from 1 to N under a design constraint. This paper extends the spread-interleaver design method to multiple error events, based on the interleaver's role in overall turbo code error event distances. The extension helps to explain why the spread interleaver is specifically designed to be semi-random. Simulation results show the performance achieved for a symbol-interleaved parallel concatenated trellis coded modulation (PCTCM) scheme.},\\n type={4},\\n author = {Fragouli, C. and Wesel, R. D.},\\n journal = {Communication Theory Symposium at Globecom 99, Rio de Janeiro, Brazil, December 5-9},\\n pages = {pages 2352--2356},\\n tags = {channel_coding},\\n title = {Semi-random interleaver design criteria},\\n volume = {5},\\n year = {1999}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Wesel, R. D.\"],\"key\":\"fragouli_semi-random_1999\",\"id\":\"fragouli_semi-random_1999\",\"bibbaseid\":\"fragouli-wesel-semirandominterleaverdesigncriteria-1999\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"Satellite-UMTS supports broadcast applications that involve transmission of the same encoded data over channels that may vary significantly. The same code must allow a user with a good channel to recover the information with low complexity, while a user with a bad channel should still be able to achieve an acceptable BER at the cost of increased complexity and/or decoding delay. To this end, we propose serially concatenated multilevel code structures that employ PSK modulation. The receiver has the flexibility to achieve turbo-code, trellis-code or uncoded performance, depending on the decoding effort. Design considerations include the constituent encoder design and the use of a non-uniform constellation. Simulation results investigate the system's performance and highlight different parameters trade-offs.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Polydoros\"],\"firstnames\":[\"A.\"],\"suffixes\":[]}],\"journal\":\"IEEE Seventh International Symposium on Spread Spectrum Techniques and Applications\",\"pages\":\"pages 697–701\",\"tags\":\"wireless,channel_coding\",\"title\":\"Serially concatenated coding for broadcasting S-UMTS applications\",\"volume\":\"vol. 3\",\"year\":\"2002\",\"bibtex\":\"@article{fragouli_serially_2002,\\n abstract = {Satellite-UMTS supports broadcast applications that involve transmission of the same encoded data over channels that may vary significantly. The same code must allow a user with a good channel to recover the information with low complexity, while a user with a bad channel should still be able to achieve an acceptable BER at the cost of increased complexity and/or decoding delay. To this end, we propose serially concatenated multilevel code structures that employ PSK modulation. The receiver has the flexibility to achieve turbo-code, trellis-code or uncoded performance, depending on the decoding effort. Design considerations include the constituent encoder design and the use of a non-uniform constellation. Simulation results investigate the system's performance and highlight different parameters trade-offs.},\\n type={4},\\n author = {Fragouli, C. and Polydoros, A.},\\n journal = {IEEE Seventh International Symposium on Spread Spectrum Techniques and Applications},\\n pages = {pages 697--701},\\n tags = {wireless,channel_coding},\\n title = {Serially concatenated coding for broadcasting {S}-{UMTS} applications},\\n volume = {vol. 3},\\n year = {2002}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Polydoros, A.\"],\"key\":\"fragouli_serially_2002\",\"id\":\"fragouli_serially_2002\",\"bibbaseid\":\"fragouli-polydoros-seriallyconcatenatedcodingforbroadcastingsumtsapplications-2002\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Orlitsky\"],\"firstnames\":[\"A.\"],\"suffixes\":[]}],\"booktitle\":\"43rd Annual Allerton Conference on Communication, Control, and Computing\",\"note\":\"event-place: University of Illinois, Urbana-Champaign, USA\",\"tags\":\"sensor_networks\",\"title\":\"Silence is golden and time is money: power-aware communication for sensor networks\",\"year\":\"2005\",\"bibtex\":\"@inproceedings{fragouli_silence_2005,\\n type={4},\\n author = {Fragouli, C. and Orlitsky, A.},\\n booktitle = {43rd {Annual} {Allerton} {Conference} on {Communication}, {Control}, and {Computing}},\\n note = {event-place: University of Illinois, Urbana-Champaign, USA},\\n tags = {sensor_networks},\\n title = {Silence is golden and time is money: power-aware communication for sensor networks},\\n year = {2005}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Orlitsky, A.\"],\"key\":\"fragouli_silence_2005\",\"id\":\"fragouli_silence_2005\",\"bibbaseid\":\"fragouli-orlitsky-silenceisgoldenandtimeismoneypowerawarecommunicationforsensornetworks-2005\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"We propose a subtree decomposition method for network coding. This approach enables derivation of tight bounds on the network code alpha- bet size, makes connections with convolutional codes transparent, allows specification of coding operations at network nodes without the knowledge of the overall network topology, and facilitates design of codes which can easily accommodate future changes in the network, such as addition of receivers and loss of links.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Soljanin\"],\"firstnames\":[\"E.\"],\"suffixes\":[]}],\"journal\":\"ISIT\",\"tags\":\"network_coding\",\"title\":\"Subtree Decomposition for Network Coding\",\"year\":\"2004\",\"bibtex\":\"@article{fragouli_subtree_2004,\\n abstract = {We propose a subtree decomposition method for network coding. This approach enables derivation of tight bounds on the network code alpha- bet size, makes connections with convolutional codes transparent, allows specification of coding operations at network nodes without the knowledge of the overall network topology, and facilitates design of codes which can easily accommodate future changes in the network, such as addition of receivers and loss of links.},\\n type={4},\\n author = {Fragouli, C. and Soljanin, E.},\\n journal = {ISIT},\\n tags = {network_coding},\\n title = {Subtree {Decomposition} for {Network} {Coding}},\\n year = {2004}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Soljanin, E.\"],\"key\":\"fragouli_subtree_2004\",\"id\":\"fragouli_subtree_2004\",\"bibbaseid\":\"fragouli-soljanin-subtreedecompositionfornetworkcoding-2004\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Polydoros\"],\"firstnames\":[\"A.\"],\"suffixes\":[]}],\"journal\":\"CISS 2002\",\"tags\":\"channel_coding\",\"title\":\"Symbol-Interleaved Serially Concatenated Turbo Codes\",\"year\":\"2002\",\"bibtex\":\"@article{fragouli_symbol-interleaved_2002,\\n type={4},\\n author = {Fragouli, C. and Polydoros, A.},\\n journal = {CISS 2002},\\n tags = {channel_coding},\\n title = {Symbol-{Interleaved} {Serially} {Concatenated} {Turbo} {Codes}},\\n year = {2002}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Polydoros, A.\"],\"key\":\"fragouli_symbol-interleaved_2002\",\"id\":\"fragouli_symbol-interleaved_2002\",\"bibbaseid\":\"fragouli-polydoros-symbolinterleavedseriallyconcatenatedturbocodes-2002\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"This paper presents a method for efficient coding at high spectral efficiency using parallel concatenated trellis coded modulation (PCTCM) with symbol interleaving. The constituent encoders are optimized for symbol-wise free distance, and each has an infinite symbol-wise impulse response. In many cases of practical interest, the optimal structure for these constituent encoders connects the memory elements in a single row. Simulation results show that the performance is as close as 0.5 dB to the constrained capacity.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wesel\"],\"firstnames\":[\"R.\",\"D.\"],\"suffixes\":[]}],\"journal\":\"Communication Theory Miniconference in conjunction with ICC '99, June 6-10 1999\",\"pages\":\"pages 42 – 46\",\"tags\":\"channel_coding\",\"title\":\"Symbol interleaved parallel concatenated trellis coded modulation\",\"year\":\"1999\",\"bibtex\":\"@article{fragouli_symbol_1999,\\n abstract = {This paper presents a method for efficient coding at high spectral efficiency using parallel concatenated trellis coded modulation (PCTCM) with symbol interleaving. The constituent encoders are optimized for symbol-wise free distance, and each has an infinite symbol-wise impulse response. In many cases of practical interest, the optimal structure for these constituent encoders connects the memory elements in a single row. Simulation results show that the performance is as close as 0.5 dB to the constrained capacity.},\\n type={4},\\n author = {Fragouli, C. and Wesel, R. D.},\\n journal = {Communication Theory Miniconference in conjunction with ICC '99, June 6-10 1999},\\n pages = {pages 42 -- 46},\\n tags = {channel_coding},\\n title = {Symbol interleaved parallel concatenated trellis coded modulation},\\n year = {1999}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Wesel, R. D.\"],\"key\":\"fragouli_symbol_1999\",\"id\":\"fragouli_symbol_1999\",\"bibbaseid\":\"fragouli-wesel-symbolinterleavedparallelconcatenatedtrelliscodedmodulation-1999\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"In this paper we propose a set of necessary and sufficient conditions under which the throughput in an ad-hoc network can remain constant as the number of nodes n increases. Throughput refers to the minimum achievable rate between a source-destination pair for a given routing mechanism and physical model, when the network is shared by \\\\Theta(n) randomly chosen source-destination pairs. The main idea is to use a connectivity graph, that does not represent the actual physical network, but rather the available communication resources.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tabet\"],\"firstnames\":[\"T.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Derdiyok\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"42nd Annual Allerton Conference on Communication, Control, and Computing\",\"note\":\"event-place: University of Illinois, Urbana-Champaign, USA\",\"tags\":\"wireless\",\"title\":\"On the Throughput of Ad-Hoc Networks using Connectivity Graphs\",\"year\":\"2004\",\"bibtex\":\"@inproceedings{fragouli_throughput_2004,\\n abstract = {In this paper we propose a set of necessary and sufficient conditions under which the throughput in an ad-hoc network can remain constant as the number of nodes n increases. Throughput refers to the minimum achievable rate between a source-destination pair for a given routing mechanism and physical model, when the network is shared by {\\\\textbackslash}Theta(n) randomly chosen source-destination pairs. The main idea is to use a connectivity graph, that does not represent the actual physical network, but rather the available communication resources.},\\n type={4},\\n author = {Fragouli, C. and Tabet, T. and Derdiyok, C.},\\n booktitle = {42nd {Annual} {Allerton} {Conference} on {Communication}, {Control}, and {Computing}},\\n note = {event-place: University of Illinois, Urbana-Champaign, USA},\\n tags = {wireless},\\n title = {On the {Throughput} of {Ad}-{Hoc} {Networks} using {Connectivity} {Graphs}},\\n year = {2004}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Tabet, T.\",\"Derdiyok, C.\"],\"key\":\"fragouli_throughput_2004\",\"id\":\"fragouli_throughput_2004\",\"bibbaseid\":\"fragouli-tabet-derdiyok-onthethroughputofadhocnetworksusingconnectivitygraphs-2004\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"The network coding paradigm is based on the idea that independent information flows can be linearly combined throughout the network to give benefits in terms of throughput, complexity etc. In this paper, we explore the application of the network coding paradigm to topology inference. Our goal is to infer the topology of a network using multiple sources and observations at the edges of the network. In particular, we consider networks where multiple sources send probes and intermediate nodes locally combine probe packets (perform XOR-operations in incoming links). In previous works (e.g., Ratnasamy &amp; McCanne '99; Duffield et al '02), the correlation between the observed packet loss patterns is used to infer the underlying topology. In contrast, our main idea behind using network coding is to introduce correlations among multiple probe packets in a topology dependent manner and also develop algorithms that take advantage of these correlations to infer the network topology from end-host observations. Preliminary numerical results illustrate the performance benefits of this approach. In particular, in the absence of packet loss, we can deterministically infer the topology, with very few probes; in the presence of packet loss, we can rapidly infer topology, even at very small loss rates (which was not the case in previous tomography techniques).\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Markopoulou\"],\"firstnames\":[\"Athina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]}],\"journal\":\"Allerton\",\"tags\":\"network_coding\",\"title\":\"Topology inference using network coding\",\"year\":\"2006\",\"bibtex\":\"@article{fragouli_topology_2006,\\n abstract = {The network coding paradigm is based on the idea that independent information flows can be linearly combined throughout the network to give benefits in terms of throughput, complexity etc. In this paper, we explore the application of the network coding paradigm to topology inference. Our goal is to infer the topology of a network using multiple sources and observations at the edges of the network. In particular, we consider networks where multiple sources send probes and intermediate nodes locally combine probe packets (perform XOR-operations in incoming links). In previous works (e.g., Ratnasamy \\\\&amp; McCanne '99; Duffield et al '02), the correlation between the observed packet loss patterns is used to infer the underlying topology. In contrast, our main idea behind using network coding is to introduce correlations among multiple probe packets in a topology dependent manner and also develop algorithms that take advantage of these correlations to infer the network topology from end-host observations. Preliminary numerical results illustrate the performance benefits of this approach. In particular, in the absence of packet loss, we can deterministically infer the topology, with very few probes; in the presence of packet loss, we can rapidly infer topology, even at very small loss rates (which was not the case in previous tomography techniques).},\\n type={4},\\n author = {Fragouli, C. and Markopoulou, Athina and Diggavi, Suhas N.},\\n journal = {Allerton},\\n tags = {network_coding},\\n title = {Topology inference using network coding},\\n year = {2006}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Markopoulou, A.\",\"Diggavi, S. N.\"],\"key\":\"fragouli_topology_2006\",\"id\":\"fragouli_topology_2006\",\"bibbaseid\":\"fragouli-markopoulou-diggavi-topologyinferenceusingnetworkcoding-2006\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"This paper addresses the problem of training sequence design for multiple-antenna transmissions over quasi-static frequency-selective channels. To achieve the channel estimation minimum mean square error, the training sequences transmitted from the multiple antennas must have impulse-like auto correlation and zero cross correlation. We reduce the problem of designing multiple training sequences to the much easier and well-understood problem of designing a single training sequence with impulse-like auto correlation. To this end, we propose to encode the training symbols with a space-time code, that may be the same or different from the space-time code that encodes the information symbols.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Al-Dhahir\"],\"firstnames\":[\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Turin\"],\"firstnames\":[\"W.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Wireless Communications\",\"pages\":\"pages 384–391\",\"tags\":\"wireless,channel_coding\",\"title\":\"Training-based channel estimation for multiple-antenna broadband transmissions\",\"volume\":\"vol. 2, no. 2\",\"year\":\"2003\",\"bibtex\":\"@article{fragouli_training-based_2003,\\n abstract = {This paper addresses the problem of training sequence design for multiple-antenna transmissions over quasi-static frequency-selective channels. To achieve the channel estimation minimum mean square error, the training sequences transmitted from the multiple antennas must have impulse-like auto correlation and zero cross correlation. We reduce the problem of designing multiple training sequences to the much easier and well-understood problem of designing a single training sequence with impulse-like auto correlation. To this end, we propose to encode the training symbols with a space-time code, that may be the same or different from the space-time code that encodes the information symbols.},\\n type={2},\\n author = {Fragouli, C. and Al-Dhahir, N. and Turin, W.},\\n journal = {IEEE Transactions on Wireless Communications},\\n pages = {pages 384--391},\\n tags = {wireless,channel_coding},\\n title = {Training-based channel estimation for multiple-antenna broadband transmissions},\\n volume = {vol. 2, no. 2},\\n year = {2003}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Al-Dhahir, N.\",\"Turin, W.\"],\"key\":\"fragouli_training-based_2003\",\"id\":\"fragouli_training-based_2003\",\"bibbaseid\":\"fragouli-aldhahir-turin-trainingbasedchannelestimationformultipleantennabroadbandtransmissions-2003\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"This paper addresses turbo-encoder design for coding with high spectral efficiency using parallel concatenated trellis-coded modulation and symbol interleaving. The turbo-encoder design involves the constituent encoder design and the interleaver design. The constituent encoders are optimized for symbol-wise effective free distance, and each has an infinite symbol-wise impulse response. We identify the canonical structures for the constituent encoder search space. In many cases of practical interest, the optimal structure for these constituent encoders connects the memory elements in a single row. This single row generally applies to turbo code constituent encoders for parallel concatenation and is not restricted to symbol interleaving. To lower the error floor, a new semi-random interleaver design criteria and a construction method extends the spread-interleaver concept introduced by Divsalar and Pollara (1995). Simulation results show that the proposed system employing symbol interleaving can converge at a lower signal-to-noise ratio than previously reported systems. We report simulation results between 0.5 and 0.6 db from constrained capacity for rates of 2 and 4 bits/s/Hz.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wesel\"],\"firstnames\":[\"R.\",\"D.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Communications, no. 3\",\"pages\":\"pages 425–435\",\"tags\":\"channel_coding\",\"title\":\"Turbo encoder design for symbol interleaved parallel concatenated trellis coded modulation\",\"volume\":\"vol. 49\",\"year\":\"2001\",\"bibtex\":\"@article{fragouli_turbo_2001,\\n abstract = {This paper addresses turbo-encoder design for coding with high spectral efficiency using parallel concatenated trellis-coded modulation and symbol interleaving. The turbo-encoder design involves the constituent encoder design and the interleaver design. The constituent encoders are optimized for symbol-wise effective free distance, and each has an infinite symbol-wise impulse response. We identify the canonical structures for the constituent encoder search space. In many cases of practical interest, the optimal structure for these constituent encoders connects the memory elements in a single row. This single row generally applies to turbo code constituent encoders for parallel concatenation and is not restricted to symbol interleaving. To lower the error floor, a new semi-random interleaver design criteria and a construction method extends the spread-interleaver concept introduced by Divsalar and Pollara (1995). Simulation results show that the proposed system employing symbol interleaving can converge at a lower signal-to-noise ratio than previously reported systems. We report simulation results between 0.5 and 0.6 db from constrained capacity for rates of 2 and 4 bits/s/Hz.},\\n type={2},\\n author = {Fragouli, C. and Wesel, R. D.},\\n journal = {IEEE Transactions on Communications, no. 3},\\n pages = {pages 425--435},\\n tags = {channel_coding},\\n title = {Turbo encoder design for symbol interleaved parallel concatenated trellis coded modulation},\\n volume = {vol. 49},\\n year = {2001}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Wesel, R. D.\"],\"key\":\"fragouli_turbo_2001\",\"id\":\"fragouli_turbo_2001\",\"bibbaseid\":\"fragouli-wesel-turboencoderdesignforsymbolinterleavedparallelconcatenatedtrelliscodedmodulation-2001\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"This paper presents parallel concatenated turbo codes that employ a non-uniform constellation to achieve shaping gain. The output signal approximates the Gaussian distribution by using equally likely signals with unequal spacing (a non-uniform constellation). The small distance of points near the center of the constellation may lead to a small overall free distance and thus a high error floor for turbo codes. We avoid this situation by a two-step design procedure, that first creates an interleaver, and then identifies the constituent encoders that maximize the turbo code free distance. Simulation results for 4 bits/sec/Hz show that this use of shaping can offer an improvement of approximately 0.2 dB for turbo codes.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wesel\"],\"firstnames\":[\"R.\",\"D.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Sommer\"],\"firstnames\":[\"D.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fettweis\"],\"firstnames\":[\"G.\",\"P.\"],\"suffixes\":[]}],\"journal\":\"ICC 2001, Helsinki, Finland\",\"pages\":\"pages 70–73\",\"tags\":\"channel_coding\",\"title\":\"Turbo Codes with Non-Uniform Constellation\",\"volume\":\"vol. 1\",\"year\":\"2001\",\"bibtex\":\"@article{fragouli_turbo_2001-1,\\n abstract = {This paper presents parallel concatenated turbo codes that employ a non-uniform constellation to achieve shaping gain. The output signal approximates the Gaussian distribution by using equally likely signals with unequal spacing (a non-uniform constellation). The small distance of points near the center of the constellation may lead to a small overall free distance and thus a high error floor for turbo codes. We avoid this situation by a two-step design procedure, that first creates an interleaver, and then identifies the constituent encoders that maximize the turbo code free distance. Simulation results for 4 bits/sec/Hz show that this use of shaping can offer an improvement of approximately 0.2 dB for turbo codes.},\\n type={4},\\n author = {Fragouli, C. and Wesel, R. D. and Sommer, D. and Fettweis, G. P.},\\n journal = {ICC 2001, Helsinki, Finland},\\n pages = {pages 70--73},\\n tags = {channel_coding},\\n title = {Turbo {Codes} with {Non}-{Uniform} {Constellation}},\\n volume = {vol. 1},\\n year = {2001}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Wesel, R. D.\",\"Sommer, D.\",\"Fettweis, G. P.\"],\"key\":\"fragouli_turbo_2001-1\",\"id\":\"fragouli_turbo_2001-1\",\"bibbaseid\":\"fragouli-wesel-sommer-fettweis-turbocodeswithnonuniformconstellation-2001\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"Wireless networks suffer from a variety of unique problems such as low throughput, dead spots, and inadequate support for mobility. However, their characteristics such as the broadcast nature of the medium, spatial diversity, and significant data redundancy, provide opportunities for new design principles to address these problems. There has been recent interest in employing network coding in wireless networks. This paper explores the case for network coding as a unifying design paradigm for wireless networks, by describing how it addresses issues of throughput, reliability, mobility, and management. We also discuss the practical challenges facing the integration of such a design into the network stack.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Katabi\"],\"firstnames\":[\"D.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Markopoulou\"],\"firstnames\":[\"Athina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Medard\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Rahul\"],\"firstnames\":[\"H.\"],\"suffixes\":[]}],\"journal\":\"IEEE MILCOM\",\"tags\":\"network_coding,wireless\",\"title\":\"Wireless network coding: opportunities and challenges\",\"year\":\"2007\",\"bibtex\":\"@article{fragouli_wireless_2007,\\n abstract = {Wireless networks suffer from a variety of unique problems such as low throughput, dead spots, and inadequate support for mobility. However, their characteristics such as the broadcast nature of the medium, spatial diversity, and significant data redundancy, provide opportunities for new design principles to address these problems. There has been recent interest in employing network coding in wireless networks. This paper explores the case for network coding as a unifying design paradigm for wireless networks, by describing how it addresses issues of throughput, reliability, mobility, and management. We also discuss the practical challenges facing the integration of such a design into the network stack.},\\n type={4},\\n author = {Fragouli, C. and Katabi, D. and Markopoulou, Athina and Medard, M. and Rahul, H.},\\n journal = {IEEE MILCOM},\\n tags = {network_coding,wireless},\\n title = {Wireless network coding: opportunities and challenges},\\n year = {2007}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Katabi, D.\",\"Markopoulou, A.\",\"Medard, M.\",\"Rahul, H.\"],\"key\":\"fragouli_wireless_2007\",\"id\":\"fragouli_wireless_2007\",\"bibbaseid\":\"fragouli-katabi-markopoulou-medard-rahul-wirelessnetworkcodingopportunitiesandchallenges-2007\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"V.\",\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]}],\"journal\":\"The Proceedings of the IEEE\",\"tags\":\"security\",\"title\":\"Wireless network security: building on erasures\",\"year\":\"2015\",\"bibtex\":\"@article{fragouli_wireless_2015,\\n type={4},\\n author = {Fragouli, C. and Czap, L. and Prabhakaran, V. M. and Diggavi, Suhas},\\n journal = {The Proceedings of the IEEE},\\n tags = {security},\\n title = {Wireless network security: building on erasures},\\n year = {2015}\\n}\\n\\n\",\"author_short\":[\"Fragouli, C.\",\"Czap, L.\",\"Prabhakaran, V. M.\",\"Diggavi, S.\"],\"key\":\"fragouli_wireless_2015\",\"id\":\"fragouli_wireless_2015\",\"bibbaseid\":\"fragouli-czap-prabhakaran-diggavi-wirelessnetworksecuritybuildingonerasures-2015\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Gatzianas\"],\"firstnames\":[\"Marios\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Saeedi\"],\"firstnames\":[\"Shirin\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings NETCOD\",\"month\":\"June\",\"tags\":\"wireless,network_coding\",\"title\":\"Feedback-based coding algorithms for broadcast erasure channels with degraded message sets\",\"year\":\"2012\",\"bibtex\":\"@inproceedings{gatzianas_feedback-based_2012,\\n type={4},\\n author = {Gatzianas, Marios and Saeedi, Shirin and Fragouli, C.},\\n booktitle = {Proceedings {NETCOD}},\\n month = {June},\\n tags = {wireless,network_coding},\\n title = {Feedback-based coding algorithms for broadcast erasure channels with degraded message sets},\\n year = {2012}\\n}\\n\\n\",\"author_short\":[\"Gatzianas, M.\",\"Saeedi, S.\",\"Fragouli, C.\"],\"key\":\"gatzianas_feedback-based_2012-1\",\"id\":\"gatzianas_feedback-based_2012-1\",\"bibbaseid\":\"gatzianas-saeedi-fragouli-feedbackbasedcodingalgorithmsforbroadcasterasurechannelswithdegradedmessagesets-2012\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Georghiu\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Saeedi\"],\"firstnames\":[\"Shirin\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Toledo\"],\"firstnames\":[\"A.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Network Coding (NetCod)\",\"tags\":\"network_coding\",\"title\":\"Degraded multicasting with network coding over the combination network\",\"year\":\"2011\",\"bibtex\":\"@inproceedings{georghiu_degraded_2011,\\n type={4},\\n author = {Georghiu, S. and Saeedi, Shirin and Fragouli, C. and Toledo, A.},\\n booktitle = {{IEEE} {International} {Symposium} on {Network} {Coding} ({NetCod})},\\n tags = {network_coding},\\n title = {Degraded multicasting with network coding over the combination network},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Georghiu, S.\",\"Saeedi, S.\",\"Fragouli, C.\",\"Toledo, A.\"],\"key\":\"georghiu_degraded_2011\",\"id\":\"georghiu_degraded_2011\",\"bibbaseid\":\"georghiu-saeedi-fragouli-toledo-degradedmulticastingwithnetworkcodingoverthecombinationnetwork-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"Network tomography infers internal network characteristics by sending and collecting probe packets from the network edge. Traditional tomographic techniques for general topologies typically use a mesh of multicast trees and/or unicast paths to cover the entire graph, which is suboptimal from the point of view of bandwidth efficiency and estimation accuracy. In this paper, we investigate an active probing method for link loss inference in a general topology, where multiple sources and receivers are used and intermediate nodes are equipped with network coding, in addition to unicast and multicast, capabilities. With our approach, each link is traversed by exactly one packet, which is in general a linear combination of the original probes. The receivers infer the loss rate on all links by observing not only the number but also the contents of the received probes. In this paper: (i) we propose an orientation algorithm that creates an acyclic graph with the maximum number of identifiable edges (ii) we define probe combining coding schemes and discuss some of their properties and (iii) we present simulation results over realistic topologies using Belief-Propagation (BP) algorithms.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Gjoka\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Sattari\"],\"firstnames\":[\"P.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Markopoulou\"],\"firstnames\":[\"Athina\"],\"suffixes\":[]}],\"journal\":\"IEEE GLOBECOM\",\"tags\":\"network_coding\",\"title\":\"Loss Tomography in General Topologies with Network Coding\",\"year\":\"2007\",\"bibtex\":\"@article{gjoka_loss_2007,\\n abstract = {Network tomography infers internal network characteristics by sending and collecting probe packets from the network edge. Traditional tomographic techniques for general topologies typically use a mesh of multicast trees and/or unicast paths to cover the entire graph, which is suboptimal from the point of view of bandwidth efficiency and estimation accuracy. In this paper, we investigate an active probing method for link loss inference in a general topology, where multiple sources and receivers are used and intermediate nodes are equipped with network coding, in addition to unicast and multicast, capabilities. With our approach, each link is traversed by exactly one packet, which is in general a linear combination of the original probes. The receivers infer the loss rate on all links by observing not only the number but also the contents of the received probes. In this paper: (i) we propose an orientation algorithm that creates an acyclic graph with the maximum number of identifiable edges (ii) we define probe combining coding schemes and discuss some of their properties and (iii) we present simulation results over realistic topologies using Belief-Propagation (BP) algorithms.},\\n type={4},\\n author = {Gjoka, M. and Fragouli, C. and Sattari, P. and Markopoulou, Athina},\\n journal = {IEEE GLOBECOM},\\n tags = {network_coding},\\n title = {Loss {Tomography} in {General} {Topologies} with {Network} {Coding}},\\n year = {2007}\\n}\\n\\n\",\"author_short\":[\"Gjoka, M.\",\"Fragouli, C.\",\"Sattari, P.\",\"Markopoulou, A.\"],\"key\":\"gjoka_loss_2007\",\"id\":\"gjoka_loss_2007\",\"bibbaseid\":\"gjoka-fragouli-sattari-markopoulou-losstomographyingeneraltopologieswithnetworkcoding-2007\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"We consider the information exchange problem where each in a set of terminals transmits information to all other terminals in the set, over an undirected network. We show that the design of only a single network code for multicasting is sufficient to achieve an arbitrary point in the achievable rate region. We also provide an alternative proof for the set of achievable rate tuples.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Goseling\"],\"firstnames\":[\"J.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]}],\"doi\":\"10.1109/lcomm.2009.081288\",\"journal\":\"Communications Letters, IEEE\",\"keywords\":\"network coding, encodingmulticasting network code, undirected information exchange\",\"month\":\"January\",\"number\":\"1\",\"pages\":\"25–27\",\"tags\":\"network_coding\",\"title\":\"Network coding for undirected information exchange\",\"volume\":\"13\",\"year\":\"2009\",\"bibtex\":\"@article{goseling_network_2009,\\n abstract = {We consider the information exchange problem where each in a set of terminals transmits information to all other terminals in the set, over an undirected network. We show that the design of only a single network code for multicasting is sufficient to achieve an arbitrary point in the achievable rate region. We also provide an alternative proof for the set of achievable rate tuples.},\\n type={4},\\n author = {Goseling, J. and Fragouli, C. and Diggavi, Suhas N.},\\n doi = {10.1109/lcomm.2009.081288},\\n journal = {Communications Letters, IEEE},\\n keywords = {network coding, encodingmulticasting network code, undirected information exchange},\\n month = {January},\\n number = {1},\\n pages = {25--27},\\n tags = {network_coding},\\n title = {Network coding for undirected information exchange},\\n volume = {13},\\n year = {2009}\\n}\\n\\n\\n\",\"author_short\":[\"Goseling, J.\",\"Fragouli, C.\",\"Diggavi, S. N.\"],\"key\":\"goseling_network_2009\",\"id\":\"goseling_network_2009\",\"bibbaseid\":\"goseling-fragouli-diggavi-networkcodingforundirectedinformationexchange-2009\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"network coding\",\"encodingmulticasting network code\",\"undirected information exchange\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hosszu\"],\"firstnames\":[\"Eva\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tapolcai\"],\"firstnames\":[\"Janos\"],\"suffixes\":[]}],\"booktitle\":\"IEEE 16th International Conference on High Performance Switching and Routing (HPSR)\",\"month\":\"July\",\"tags\":\"channel_coding\",\"title\":\"Combinatorial error detection in linear encoders\",\"year\":\"2015\",\"bibtex\":\"@inproceedings{hosszu_combinatorial_2015,\\n type={4},\\n author = {Hosszu, Eva and Fragouli, C. and Tapolcai, Janos},\\n booktitle = {{IEEE} 16th {International} {Conference} on {High} {Performance} {Switching} and {Routing} ({HPSR})},\\n month = {July},\\n tags = {channel_coding},\\n title = {Combinatorial error detection in linear encoders},\\n year = {2015}\\n}\\n\\n\",\"author_short\":[\"Hosszu, E.\",\"Fragouli, C.\",\"Tapolcai, J.\"],\"key\":\"hosszu_combinatorial_2015\",\"id\":\"hosszu_combinatorial_2015\",\"bibbaseid\":\"hosszu-fragouli-tapolcai-combinatorialerrordetectioninlinearencoders-2015\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"The performance of peer-to-peer (P2P) networks depends critically on the good connectivity of the overlay topology. In this paper we study P2P networks for content distribution (such as Avalanche) that use randomized network coding techniques. The basic idea of such systems is that peers randomly combine and exchange linear combinations of the source packets. A header appended to each packet specifies the linear combination that the packet carries. In this paper we show that the linear combinations a node receives from its neighbors reveal structural information about the network. We propose algorithms to utilize this observation for topology management to avoid bottlenecks and clustering in network-coded P2P systems. Our approach is decentralized, inherently adapts to the network topology, and reduces substantially the number of topology rewirings that are necessary to maintain a well connected overlay. Moreover, this is done passively during the normal content distribution. This work demonstrates another value of using network coding and complements previous work that showed network coding achieves high utilization of the network resources.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Jafari\",\"Siavoshani\"],\"firstnames\":[\"Mahdi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Gkantsidis\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"SIGCOMM INM\",\"tags\":\"network_coding\",\"title\":\"Bottleneck discovery and overlay management in network coded Peer-to-Peer systems\",\"year\":\"2007\",\"bibtex\":\"@article{jafari_siavoshani_bottleneck_2007,\\n abstract = {The performance of peer-to-peer (P2P) networks depends critically on the good connectivity of the overlay topology. In this paper we study P2P networks for content distribution (such as Avalanche) that use randomized network coding techniques. The basic idea of such systems is that peers randomly combine and exchange linear combinations of the source packets. A header appended to each packet specifies the linear combination that the packet carries. In this paper we show that the linear combinations a node receives from its neighbors reveal structural information about the network. We propose algorithms to utilize this observation for topology management to avoid bottlenecks and clustering in network-coded P2P systems. Our approach is decentralized, inherently adapts to the network topology, and reduces substantially the number of topology rewirings that are necessary to maintain a well connected overlay. Moreover, this is done passively during the normal content distribution. This work demonstrates another value of using network coding and complements previous work that showed network coding achieves high utilization of the network resources.},\\n type={4},\\n author = {Jafari Siavoshani, Mahdi and Fragouli, C. and Diggavi, Suhas N. and Gkantsidis, C.},\\n journal = {SIGCOMM INM},\\n tags = {network_coding},\\n title = {Bottleneck discovery and overlay management in network coded {Peer}-to-{Peer} systems},\\n year = {2007}\\n}\\n\\n\",\"author_short\":[\"Jafari Siavoshani, M.\",\"Fragouli, C.\",\"Diggavi, S. N.\",\"Gkantsidis, C.\"],\"key\":\"jafari_siavoshani_bottleneck_2007\",\"id\":\"jafari_siavoshani_bottleneck_2007\",\"bibbaseid\":\"jafarisiavoshani-fragouli-diggavi-gkantsidis-bottleneckdiscoveryandoverlaymanagementinnetworkcodedpeertopeersystems-2007\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"The min-cut value towards a single receiver in a network with unit capacity edges can be achieved by routing a single bit. The multicast theorem in network coding shows that, the common min-cut value towards N ges 1 receivers can also be achieved using packets of length logN bits, if the operations the intermediate nodes perform are deterministically known at the receivers. We here calculate the capacity in the case where these operations are unknown, and characterize how the capacity depends on the min-cut value and the packet length.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Jafari\",\"Siavoshani\"],\"firstnames\":[\"Mahdi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Mohajer\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]}],\"booktitle\":\"Information Theory, 2009. ISIT 2009. IEEE International Symposium on\",\"doi\":\"10.1109/isit.2009.5205851\",\"keywords\":\"multicast theorem, noncoherent network coding, packet length, single bit routing, source coding, telecommunication network routingmin-cut value towards\",\"month\":\"July\",\"pages\":\"273–277\",\"tags\":\"network_coding,wireless\",\"title\":\"On the capacity of non-coherent network coding\",\"year\":\"2009\",\"bibtex\":\"@inproceedings{jafari_siavoshani_capacity_2009,\\n abstract = {The min-cut value towards a single receiver in a network with unit capacity edges can be achieved by routing a single bit. The multicast theorem in network coding shows that, the common min-cut value towards N ges 1 receivers can also be achieved using packets of length logN bits, if the operations the intermediate nodes perform are deterministically known at the receivers. We here calculate the capacity in the case where these operations are unknown, and characterize how the capacity depends on the min-cut value and the packet length.},\\n type={4},\\n author = {Jafari Siavoshani, Mahdi and Mohajer, S. and Fragouli, C. and Diggavi, Suhas N.},\\n booktitle = {Information {Theory}, 2009. {ISIT} 2009. {IEEE} {International} {Symposium} on},\\n doi = {10.1109/isit.2009.5205851},\\n keywords = {multicast theorem, noncoherent network coding, packet length, single bit routing, source coding, telecommunication network routingmin-cut value towards},\\n month = {July},\\n pages = {273--277},\\n tags = {network_coding,wireless},\\n title = {On the capacity of non-coherent network coding},\\n year = {2009}\\n}\\n\\n\",\"author_short\":[\"Jafari Siavoshani, M.\",\"Mohajer, S.\",\"Fragouli, C.\",\"Diggavi, S. N.\"],\"key\":\"jafari_siavoshani_capacity_2009\",\"id\":\"jafari_siavoshani_capacity_2009\",\"bibbaseid\":\"jafarisiavoshani-mohajer-fragouli-diggavi-onthecapacityofnoncoherentnetworkcoding-2009\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"multicast theorem\",\"noncoherent network coding\",\"packet length\",\"single bit routing\",\"source coding\",\"telecommunication network routingmin-cut value towards\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"We consider the problem of multicasting information from a source to a set of receivers over a network where intermediate network nodes perform randomized network coding operations on the source packets. We propose a channel model for the non-coherent network coding introduced by Koetter and Kschischang in [6], that captures the essence of such a network operation, and calculate the capacity as a function of network parameters. We prove that use of subspace coding is optimal, and show that, in some cases, the capacity-achieving distribution uses subspaces of several dimensions, where the employed dimensions depend on the packet length. This model and the results also allow us to give guidelines on when subspace coding is beneficial for the proposed model and by how much, in comparison to a coding vector approach, from a capacity viewpoint. We extend our results to the case of multiple source multicast that creates a virtual multiple access channel.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Jafari\",\"Siavoshani\"],\"firstnames\":[\"Mahdi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Mohajer\"],\"firstnames\":[\"Soheil\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory (Special Issue on Facets of Coding Theory: from Algorithms to Networks)\",\"month\":\"February\",\"number\":\"2\",\"pages\":\"1046–1066\",\"tags\":\"network_coding\",\"title\":\"On the capacity of non-coherent network coding\",\"volume\":\"57\",\"year\":\"2011\",\"bibtex\":\"@article{jafari_siavoshani_capacity_2011,\\n abstract = {We consider the problem of multicasting information from a source to a set of receivers over a network where intermediate network nodes perform randomized network coding operations on the source packets. We propose a channel model for the non-coherent network coding introduced by Koetter and Kschischang in [6], that captures the essence of such a network operation, and calculate the capacity as a function of network parameters. We prove that use of subspace coding is optimal, and show that, in some cases, the capacity-achieving distribution uses subspaces of several dimensions, where the employed dimensions depend on the packet length. This model and the results also allow us to give guidelines on when subspace coding is beneficial for the proposed model and by how much, in comparison to a coding vector approach, from a capacity viewpoint. We extend our results to the case of multiple source multicast that creates a virtual multiple access channel.},\\n type={2},\\n author = {Jafari Siavoshani, Mahdi and Mohajer, Soheil and Fragouli, C. and Diggavi, Suhas N.},\\n journal = {IEEE Transactions on Information Theory (Special Issue on Facets of Coding Theory: from Algorithms to Networks)},\\n month = {February},\\n number = {2},\\n pages = {1046--1066},\\n tags = {network_coding},\\n title = {On the capacity of non-coherent network coding},\\n volume = {57},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Jafari Siavoshani, M.\",\"Mohajer, S.\",\"Fragouli, C.\",\"Diggavi, S. N.\"],\"key\":\"jafari_siavoshani_capacity_2011\",\"id\":\"jafari_siavoshani_capacity_2011\",\"bibbaseid\":\"jafarisiavoshani-mohajer-fragouli-diggavi-onthecapacityofnoncoherentnetworkcoding-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"In networks that employ network coding, two main approaches have been proposed in the literature to allow the receivers to recover the source information: (i) use of coding vectors, that keep track of the linear combinations the received packets contain, and (ii) subspace coding, that dispenses of the need to know the linear combinations, since information is conveyed from the choice of subspaces alone. Both these approaches impose the strong requirement that all source packets get potentially combined. We here present a third approach that relaxes this assumption, and is thus not a special case from either of the previous two. This relaxation allows to employ compressed coding vectors to efficiently convey the coding coefficients, without altering the operation of intermediate network nodes. We develop optimal designs for such vectors.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Jafari\",\"Siavoshani\"],\"firstnames\":[\"Mahdi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Keller\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Argyraki\"],\"firstnames\":[\"K.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"Information Theory, 2009. ISIT 2009. IEEE International Symposium on\",\"doi\":\"10.1109/isit.2009.5206041\",\"keywords\":\"linear codes, data compression, intermediate network node, linear combination, subspace coding, vectorscompressed network coding vector\",\"month\":\"July\",\"pages\":\"109–113\",\"tags\":\"network_coding,sensor_networks\",\"title\":\"Compressed network coding vectors\",\"year\":\"2009\",\"bibtex\":\"@inproceedings{jafari_siavoshani_compressed_2009,\\n abstract = {In networks that employ network coding, two main approaches have been proposed in the literature to allow the receivers to recover the source information: (i) use of coding vectors, that keep track of the linear combinations the received packets contain, and (ii) subspace coding, that dispenses of the need to know the linear combinations, since information is conveyed from the choice of subspaces alone. Both these approaches impose the strong requirement that all source packets get potentially combined. We here present a third approach that relaxes this assumption, and is thus not a special case from either of the previous two. This relaxation allows to employ compressed coding vectors to efficiently convey the coding coefficients, without altering the operation of intermediate network nodes. We develop optimal designs for such vectors.},\\n type={4},\\n author = {Jafari Siavoshani, Mahdi and Keller, L. and Argyraki, K. and Fragouli, C.},\\n booktitle = {Information {Theory}, 2009. {ISIT} 2009. {IEEE} {International} {Symposium} on},\\n doi = {10.1109/isit.2009.5206041},\\n keywords = {linear codes, data compression, intermediate network node, linear combination, subspace coding, vectorscompressed network coding vector},\\n month = {July},\\n pages = {109--113},\\n tags = {network_coding,sensor_networks},\\n title = {Compressed network coding vectors},\\n year = {2009}\\n}\\n\\n\",\"author_short\":[\"Jafari Siavoshani, M.\",\"Keller, L.\",\"Argyraki, K.\",\"Fragouli, C.\"],\"key\":\"jafari_siavoshani_compressed_2009\",\"id\":\"jafari_siavoshani_compressed_2009\",\"bibbaseid\":\"jafarisiavoshani-keller-argyraki-fragouli-compressednetworkcodingvectors-2009\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"linear codes\",\"data compression\",\"intermediate network node\",\"linear combination\",\"subspace coding\",\"vectorscompressed network coding vector\"],\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Jafari\",\"Siavoshani\"],\"firstnames\":[\"Mahdi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Mishra\"],\"firstnames\":[\"Shaunak\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"month\":\"August\",\"tags\":\"security\",\"title\":\"Group secret key agreement over state-dependent wireless broadcast channels\",\"year\":\"2011\",\"bibtex\":\"@inproceedings{jafari_siavoshani_group_2011,\\n type={4},\\n author = {Jafari Siavoshani, Mahdi and Mishra, Shaunak and Diggavi, Suhas N. and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n month = {August},\\n tags = {security},\\n title = {Group secret key agreement over state-dependent wireless broadcast channels},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Jafari Siavoshani, M.\",\"Mishra, S.\",\"Diggavi, S. N.\",\"Fragouli, C.\"],\"key\":\"jafari_siavoshani_group_2011\",\"id\":\"jafari_siavoshani_group_2011\",\"bibbaseid\":\"jafarisiavoshani-mishra-diggavi-fragouli-groupsecretkeyagreementoverstatedependentwirelessbroadcastchannels-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"We examine networks that employ network coding, and are subject to Byzantine attacks. We consider systems where an appropriate network error correcting scheme is employed that is able to correct (up to a certain number of) Byzantine errors. Given this setup, we formulate the problem of locating these malicious nodes that insert errors. We utilize the subspace properties of (randomized) network coding to develop algorithms to locate the Byzantine attackers.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Jafari\",\"Siavoshani\"],\"firstnames\":[\"Mahdi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]}],\"journal\":\"Network Coding Workshop: Theory and Applications\",\"tags\":\"network_coding\",\"title\":\"On Locating Byzantine Attackers\",\"year\":\"2008\",\"bibtex\":\"@article{jafari_siavoshani_locating_2008,\\n abstract = {We examine networks that employ network coding, and are subject to Byzantine attacks. We consider systems where an appropriate network error correcting scheme is employed that is able to correct (up to a certain number of) Byzantine errors. Given this setup, we formulate the problem of locating these malicious nodes that insert errors. We utilize the subspace properties of (randomized) network coding to develop algorithms to locate the Byzantine attackers.},\\n type={4},\\n author = {Jafari Siavoshani, Mahdi and Fragouli, C. and Diggavi, Suhas N.},\\n journal = {Network Coding Workshop: Theory and Applications},\\n tags = {network_coding},\\n title = {On {Locating} {Byzantine} {Attackers}},\\n year = {2008}\\n}\\n\\n\",\"author_short\":[\"Jafari Siavoshani, M.\",\"Fragouli, C.\",\"Diggavi, S. N.\"],\"key\":\"jafari_siavoshani_locating_2008\",\"id\":\"jafari_siavoshani_locating_2008\",\"bibbaseid\":\"jafarisiavoshani-fragouli-diggavi-onlocatingbyzantineattackers-2008\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"We examine the problem of multiple sources transmitting information to one or more receivers that require the information from all the sources, over a network where the network nodes perform randomized network coding. We consider the noncoherent case, where neither the sources nor the receivers have any knowledge of the intermediate nodes operations. We formulate a model for this problem, inspired from block- fading noncoherent MIMO communications. We prove, using information theoretic tools, that coding over subspaces is sufficient to achieve the capacity, and give bounds for the capacity. We then examine the associated combinatorial problem of code design. We extend the work by Koetter and Kschischang [3] to code constructions for the multisource case. Our constructions can also be viewed as coding for the noncoherent multiple-access finite-field channel.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Jafari\",\"Siavoshani\"],\"firstnames\":[\"Mahdi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]}],\"journal\":\"IEEE International Symposium on Information Theory (ISIT)\",\"tags\":\"network_coding,wireless\",\"title\":\"Noncoherent multi-source network coding\",\"year\":\"2008\",\"bibtex\":\"@article{jafari_siavoshani_noncoherent_2008,\\n abstract = {We examine the problem of multiple sources transmitting information to one or more receivers that require the information from all the sources, over a network where the network nodes perform randomized network coding. We consider the noncoherent case, where neither the sources nor the receivers have any knowledge of the intermediate nodes operations. We formulate a model for this problem, inspired from block- fading noncoherent MIMO communications. We prove, using information theoretic tools, that coding over subspaces is sufficient to achieve the capacity, and give bounds for the capacity. We then examine the associated combinatorial problem of code design. We extend the work by Koetter and Kschischang [3] to code constructions for the multisource case. Our constructions can also be viewed as coding for the noncoherent multiple-access finite-field channel.},\\n type={4},\\n author = {Jafari Siavoshani, Mahdi and Fragouli, C. and Diggavi, Suhas N.},\\n journal = {IEEE International Symposium on Information Theory (ISIT)},\\n tags = {network_coding,wireless},\\n title = {Noncoherent multi-source network coding},\\n year = {2008}\\n}\\n\\n\",\"author_short\":[\"Jafari Siavoshani, M.\",\"Fragouli, C.\",\"Diggavi, S. N.\"],\"key\":\"jafari_siavoshani_noncoherent_2008\",\"id\":\"jafari_siavoshani_noncoherent_2008\",\"bibbaseid\":\"jafarisiavoshani-fragouli-diggavi-noncoherentmultisourcenetworkcoding-2008\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"Randomized network coding has network nodes randomly combine and exchange linear combinations of the source packets. A header appended to the packet, called coding vector, specifies the exact linear combination that each packet carries. The main contribution of this work is to investigate properties of the subspacesspanned by the collected coding vectors in each network node. We use these properties to exhibit the relationship between the network topology and the subspaces collected at the nodes. This allows us to passively infer the network topology for a general class of graphs.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Jafari\",\"Siavoshani\"],\"firstnames\":[\"Mahdi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Information Theory Workshop (ITW)\",\"tags\":\"network_coding\",\"title\":\"Subspace properties of randomized network coding\",\"year\":\"2007\",\"bibtex\":\"@inproceedings{jafari_siavoshani_subspace_2007,\\n abstract = {Randomized network coding has network nodes randomly combine and exchange linear combinations of the source packets. A header appended to the packet, called coding vector, specifies the exact linear combination that each packet carries. The main contribution of this work is to investigate properties of the subspacesspanned by the collected coding vectors in each network node. We use these properties to exhibit the relationship between the network topology and the subspaces collected at the nodes. This allows us to passively infer the network topology for a general class of graphs.},\\n type={4},\\n author = {Jafari Siavoshani, Mahdi and Fragouli, C. and Diggavi, Suhas N.},\\n booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},\\n tags = {network_coding},\\n title = {Subspace properties of randomized network coding},\\n year = {2007}\\n}\\n\\n\",\"author_short\":[\"Jafari Siavoshani, M.\",\"Fragouli, C.\",\"Diggavi, S. N.\"],\"key\":\"jafari_siavoshani_subspace_2007\",\"id\":\"jafari_siavoshani_subspace_2007\",\"bibbaseid\":\"jafarisiavoshani-fragouli-diggavi-subspacepropertiesofrandomizednetworkcoding-2007\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Jafari\",\"Siavoshani\"],\"firstnames\":[\"Mahdi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"tags\":\"network_coding\",\"title\":\"Subspace properties of network coding and their applications\",\"year\":\"2008\",\"bibtex\":\"@article{jafari_siavoshani_subspace_2008,\\n type={2},\\n author = {Jafari Siavoshani, Mahdi and Fragouli, C. and Diggavi, Suhas N.},\\n journal = {IEEE Transactions on Information Theory},\\n tags = {network_coding},\\n title = {Subspace properties of network coding and their applications},\\n year = {2008}\\n}\\n\\n\",\"author_short\":[\"Jafari Siavoshani, M.\",\"Fragouli, C.\",\"Diggavi, S. N.\"],\"key\":\"jafari_siavoshani_subspace_2008\",\"id\":\"jafari_siavoshani_subspace_2008\",\"bibbaseid\":\"jafarisiavoshani-fragouli-diggavi-subspacepropertiesofnetworkcodingandtheirapplications-2008\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"This paper addresses the problem of distributed rate allocation for a class of multicast networks employing linear network coding. The goal is to minimize the cost (for example, the sum rates allocated to each link in the network) while satisfying a multicast rate requirement for each destination in the network. In essence, this paper aims to achieve network capacity while ensuring that the cost of operation (equivalently, the rate allocated per link in the network) is minimal. This paper uses a belief propagation framework to obtain a distributed algorithm for the rate allocation problem. Simulation results are presented to demonstrate the convergence of this algorithm to the optimal rate allocation solution.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Jafarian\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Lee\"],\"firstnames\":[\"Sang\",\"Hyun\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Vishwanath\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"Sensor, Mesh and Ad Hoc Communications and Networks Workshops, 2009. SECON Workshops '09. 6th Annual IEEE Communications Society Conference on\",\"doi\":\"10.1109/sahcnw.2009.5172929\",\"keywords\":\"cost minimization, distributed algorithm, distributed algorithms, distributed rate allocation, linear codes, linear network coding, minimisationbelief propagation framework, multicast network, network capacity, network-coded system\",\"month\":\"June\",\"pages\":\"1–6\",\"tags\":\"wireless\",\"title\":\"Distributed Rate Allocation for Network-coded Systems\",\"year\":\"2009\",\"bibtex\":\"@inproceedings{jafarian_distributed_2009,\\n abstract = {This paper addresses the problem of distributed rate allocation for a class of multicast networks employing linear network coding. The goal is to minimize the cost (for example, the sum rates allocated to each link in the network) while satisfying a multicast rate requirement for each destination in the network. In essence, this paper aims to achieve network capacity while ensuring that the cost of operation (equivalently, the rate allocated per link in the network) is minimal. This paper uses a belief propagation framework to obtain a distributed algorithm for the rate allocation problem. Simulation results are presented to demonstrate the convergence of this algorithm to the optimal rate allocation solution.},\\n type={4},\\n author = {Jafarian, A. and Lee, Sang Hyun and Vishwanath, S. and Fragouli, C.},\\n booktitle = {Sensor, {Mesh} and {Ad} {Hoc} {Communications} and {Networks} {Workshops}, 2009. {SECON} {Workshops} '09. 6th {Annual} {IEEE} {Communications} {Society} {Conference} on},\\n doi = {10.1109/sahcnw.2009.5172929},\\n keywords = {cost minimization, distributed algorithm, distributed algorithms, distributed rate allocation, linear codes, linear network coding, minimisationbelief propagation framework, multicast network, network capacity, network-coded system},\\n month = {June},\\n pages = {1--6},\\n tags = {wireless},\\n title = {Distributed {Rate} {Allocation} for {Network}-coded {Systems}},\\n year = {2009}\\n}\\n\\n\",\"author_short\":[\"Jafarian, A.\",\"Lee, S. H.\",\"Vishwanath, S.\",\"Fragouli, C.\"],\"key\":\"jafarian_distributed_2009\",\"id\":\"jafarian_distributed_2009\",\"bibbaseid\":\"jafarian-lee-vishwanath-fragouli-distributedrateallocationfornetworkcodedsystems-2009\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"cost minimization\",\"distributed algorithm\",\"distributed algorithms\",\"distributed rate allocation\",\"linear codes\",\"linear network coding\",\"minimisationbelief propagation framework\",\"multicast network\",\"network capacity\",\"network-coded system\"],\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Karamchandani\"],\"firstnames\":[\"Nikhil\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Keller\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Franceschetti\"],\"firstnames\":[\"Massimo\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"doi\":\"10.1109/isit.2010.5513755\",\"tags\":\"wireless,network_coding\",\"title\":\"Function computation via subspace coding\",\"year\":\"2010\",\"bibtex\":\"@inproceedings{karamchandani_function_2010,\\n abstract = {This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.},\\n type={4},\\n author = {Karamchandani, Nikhil and Keller, L. and Fragouli, C. and Franceschetti, Massimo},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n doi = {10.1109/isit.2010.5513755},\\n tags = {wireless,network_coding},\\n title = {Function computation via subspace coding},\\n year = {2010}\\n}\\n\\n\",\"author_short\":[\"Karamchandani, N.\",\"Keller, L.\",\"Fragouli, C.\",\"Franceschetti, M.\"],\"key\":\"karamchandani_function_2010-1\",\"id\":\"karamchandani_function_2010-1\",\"bibbaseid\":\"karamchandani-keller-fragouli-franceschetti-functioncomputationviasubspacecoding-2010\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Karamchandani\"],\"firstnames\":[\"Nikhil\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Keller\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Franceschetti\"],\"firstnames\":[\"Massimo\"],\"suffixes\":[]}],\"doi\":\"10.1016/j.phycom.2012.02.007\",\"issn\":\"1874-4907\",\"journal\":\"Physical Communication\",\"keywords\":\"Wireless sensor network\",\"number\":\"0\",\"tags\":\"sensor_networks\",\"title\":\"Function computation via subspace coding\",\"url\":\"http://www.sciencedirect.com/science/article/pii/S1874490712000201\",\"year\":\"2012\",\"bibtex\":\"@article{karamchandani_function_2012,\\n abstract = {This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.},\\n type={4},\\n author = {Karamchandani, Nikhil and Keller, L. and Fragouli, C. and Franceschetti, Massimo},\\n doi = {10.1016/j.phycom.2012.02.007},\\n issn = {1874-4907},\\n journal = {Physical Communication},\\n keywords = {Wireless sensor network},\\n number = {0},\\n tags = {sensor_networks},\\n title = {Function computation via subspace coding},\\n url = {http://www.sciencedirect.com/science/article/pii/S1874490712000201},\\n year = {2012}\\n}\\n\\n\",\"author_short\":[\"Karamchandani, N.\",\"Keller, L.\",\"Fragouli, C.\",\"Franceschetti, M.\"],\"key\":\"karamchandani_function_2012\",\"id\":\"karamchandani_function_2012\",\"bibbaseid\":\"karamchandani-keller-fragouli-franceschetti-functioncomputationviasubspacecoding-2012\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://www.sciencedirect.com/science/article/pii/S1874490712000201\"},\"keyword\":[\"Wireless sensor network\"],\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Karmoose\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Song\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Information Theory Workshop (ITW)\",\"tags\":\"network_coding\",\"title\":\"Preserving Privacy while Broadcasting: k-Limited-Access Schemes\",\"year\":\"2017\",\"bibtex\":\"@inproceedings{karmoose_preserving_2017,\\n type={4},\\n author = {Karmoose, M. and Song, L. and Cardone, M. and Fragouli, C.},\\n booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},\\n tags = {network_coding},\\n title = {Preserving {Privacy} while {Broadcasting}: k-{Limited}-{Access} {Schemes}},\\n year = {2017}\\n}\\n\\n\",\"author_short\":[\"Karmoose, M.\",\"Song, L.\",\"Cardone, M.\",\"Fragouli, C.\"],\"key\":\"karmoose_preserving_2017\",\"id\":\"karmoose_preserving_2017\",\"bibbaseid\":\"karmoose-song-cardone-fragouli-preservingprivacywhilebroadcastingklimitedaccessschemes-2017\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Karmoose\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Song\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"tags\":\"network_coding\",\"title\":\"Privacy in Index Coding: Improved Bounds and Coding Schemes\",\"year\":\"2018\",\"bibtex\":\"@inproceedings{karmoose_privacy_2018,\\n type={4},\\n author = {Karmoose, M. and Song, L. and Cardone, M. and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n tags = {network_coding},\\n title = {Privacy in {Index} {Coding}: {Improved} {Bounds} and {Coding} {Schemes}},\\n year = {2018}\\n}\\n\\n\",\"author_short\":[\"Karmoose, M.\",\"Song, L.\",\"Cardone, M.\",\"Fragouli, C.\"],\"key\":\"karmoose_privacy_2018\",\"id\":\"karmoose_privacy_2018\",\"bibbaseid\":\"karmoose-song-cardone-fragouli-privacyinindexcodingimprovedboundsandcodingschemes-2018\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Karmoose\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Song\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"tags\":\"network_coding\",\"title\":\"Privacy in Index Coding: k-Limited-Access Schemes\",\"year\":\"2019\",\"bibtex\":\"@article{karmoose_privacy_2019,\\n type={2},\\n author = {Karmoose, M. and Song, L. and Cardone, M. and Fragouli, C.},\\n journal = {IEEE Transactions on Information Theory},\\n tags = {network_coding},\\n title = {Privacy in {Index} {Coding}: k-{Limited}-{Access} {Schemes}},\\n year = {2019}\\n}\\n\\n\",\"author_short\":[\"Karmoose, M.\",\"Song, L.\",\"Cardone, M.\",\"Fragouli, C.\"],\"key\":\"karmoose_privacy_2019\",\"id\":\"karmoose_privacy_2019\",\"bibbaseid\":\"karmoose-song-cardone-fragouli-privacyinindexcodingklimitedaccessschemes-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Karmoose\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Song\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"month\":\"January\",\"tags\":\"network_coding\",\"title\":\"Private Broadcasting: an Index Coding Approach\",\"year\":\"2017\",\"bibtex\":\"@inproceedings{karmoose_private_2017,\\n type={4},\\n author = {Karmoose, M. and Song, L. and Cardone, M. and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n month = {January},\\n tags = {network_coding},\\n title = {Private {Broadcasting}: an {Index} {Coding} {Approach}},\\n year = {2017}\\n}\\n\\n\",\"author_short\":[\"Karmoose, M.\",\"Song, L.\",\"Cardone, M.\",\"Fragouli, C.\"],\"key\":\"karmoose_private_2017\",\"id\":\"karmoose_private_2017\",\"bibbaseid\":\"karmoose-song-cardone-fragouli-privatebroadcastinganindexcodingapproach-2017\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Karmoose\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"tags\":\"network_coding\",\"title\":\"Simplifying Wireless Social Caching\",\"year\":\"2016\",\"bibtex\":\"@inproceedings{karmoose_simplifying_2016,\\n type={4},\\n author = {Karmoose, M. and Cardone, M. and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n tags = {network_coding},\\n title = {Simplifying {Wireless} {Social} {Caching}},\\n year = {2016}\\n}\\n\\n\",\"author_short\":[\"Karmoose, M.\",\"Cardone, M.\",\"Fragouli, C.\"],\"key\":\"karmoose_simplifying_2016\",\"id\":\"karmoose_simplifying_2016\",\"bibbaseid\":\"karmoose-cardone-fragouli-simplifyingwirelesssocialcaching-2016\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Karmoose\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cardone\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Transactions on Communications\",\"tags\":\"network_coding\",\"title\":\"Simplifying Wireless Social Caching via Network Coding\",\"year\":\"2018\",\"bibtex\":\"@inproceedings{karmoose_simplifying_2018,\\n type={2},\\n author = {Karmoose, M. and Cardone, M. and Fragouli, C.},\\n booktitle = {{IEEE} {Transactions} on {Communications}},\\n tags = {network_coding},\\n title = {Simplifying {Wireless} {Social} {Caching} via {Network} {Coding}},\\n year = {2018}\\n}\\n\\n\",\"author_short\":[\"Karmoose, M.\",\"Cardone, M.\",\"Fragouli, C.\"],\"key\":\"karmoose_simplifying_2018\",\"id\":\"karmoose_simplifying_2018\",\"bibbaseid\":\"karmoose-cardone-fragouli-simplifyingwirelesssocialcachingvianetworkcoding-2018\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Karmoose\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\",\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Misoczki\"],\"firstnames\":[\"Rafael\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Yang\"],\"firstnames\":[\"Lily\",\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Zhang\"],\"firstnames\":[\"Zhenliang\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Communications Letters\",\"tags\":\"security\",\"title\":\"Using mm-Waves for Secret Key Establishmen\",\"year\":\"2019\",\"bibtex\":\"@inproceedings{karmoose_using_2019,\\n type={4},\\n author = {Karmoose, M. and Fragouli, C. and Diggavi, S. N. and Misoczki, Rafael and Yang, Lily L. and Zhang, Zhenliang},\\n booktitle = {{IEEE} {Communications} {Letters}},\\n tags = {security},\\n title = {Using mm-{Waves} for {Secret} {Key} {Establishmen}},\\n year = {2019}\\n}\\n\\n\",\"author_short\":[\"Karmoose, M.\",\"Fragouli, C.\",\"Diggavi, S. N.\",\"Misoczki, R.\",\"Yang, L. L.\",\"Zhang, Z.\"],\"key\":\"karmoose_using_2019\",\"id\":\"karmoose_using_2019\",\"bibbaseid\":\"karmoose-fragouli-diggavi-misoczki-yang-zhang-usingmmwavesforsecretkeyestablishmen-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Keller\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Karamchandani\"],\"firstnames\":[\"Nikhil\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Network Coding (NetCod)\",\"doi\":\"10.1109/NETCOD.2010.5487679\",\"tags\":\"wireless,network_coding\",\"title\":\"Function computation over linear channels\",\"year\":\"2010\",\"bibtex\":\"@inproceedings{keller_function_2010,\\n abstract = {This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.},\\n type={4},\\n author = {Keller, L. and Karamchandani, Nikhil and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} on {Network} {Coding} ({NetCod})},\\n doi = {10.1109/NETCOD.2010.5487679},\\n tags = {wireless,network_coding},\\n title = {Function computation over linear channels},\\n year = {2010}\\n}\\n\\n\",\"author_short\":[\"Keller, L.\",\"Karamchandani, N.\",\"Fragouli, C.\"],\"key\":\"keller_function_2010-1\",\"id\":\"keller_function_2010-1\",\"bibbaseid\":\"keller-karamchandani-fragouli-functioncomputationoverlinearchannels-2010\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"In a significant class of sensor-network applications, the identities of the reporting sensors constitute the bulk of the communicated data, whereas the message itself can be as small as a single bit - for instance, in many cases, sensors are used to detect whether and where a certain interesting condition occured, or to track incremental environmental changes at fixed locations. In such scenarios, the traditional network-protocol paradigm of separately specifying the source identity and the message in distinct fields leads to inefficient communication. This work addresses the question of how should communication happen in such identity-aware sensor networks. We reexamine the traditional source-identity/message separation and propose a scheme for jointly encoding the two. We use this to develop a communication method for identity-aware sensor networks and show it to be energy efficient, simple to implement, and gracefully adaptable to scenarios frequently encountered in sensor networks - for instance, node failures, or large numbers of nodes where only few are active during each reporting round.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Keller\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Jafari\",\"Siavoshani\"],\"firstnames\":[\"Mahdi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Argyraki\"],\"firstnames\":[\"K.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]}],\"booktitle\":\"INFOCOM 2009, IEEE\",\"doi\":\"10.1109/infcom.2009.5062142\",\"keywords\":\"identity aware sensor networks, source-identity-message separation, wireless sensor networks, wireless sensor networksenergy efficient\",\"month\":\"April\",\"note\":\"ISSN: 0743-166X\",\"pages\":\"2177–2185\",\"tags\":\"sensor_networks\",\"title\":\"Identity aware sensor networks\",\"year\":\"2009\",\"bibtex\":\"@inproceedings{keller_identity_2009,\\n abstract = {In a significant class of sensor-network applications, the identities of the reporting sensors constitute the bulk of the communicated data, whereas the message itself can be as small as a single bit - for instance, in many cases, sensors are used to detect whether and where a certain interesting condition occured, or to track incremental environmental changes at fixed locations. In such scenarios, the traditional network-protocol paradigm of separately specifying the source identity and the message in distinct fields leads to inefficient communication. This work addresses the question of how should communication happen in such identity-aware sensor networks. We reexamine the traditional source-identity/message separation and propose a scheme for jointly encoding the two. We use this to develop a communication method for identity-aware sensor networks and show it to be energy efficient, simple to implement, and gracefully adaptable to scenarios frequently encountered in sensor networks - for instance, node failures, or large numbers of nodes where only few are active during each reporting round.},\\n type={4},\\n author = {Keller, L. and Jafari Siavoshani, Mahdi and Fragouli, C. and Argyraki, K. and Diggavi, Suhas N.},\\n booktitle = {{INFOCOM} 2009, {IEEE}},\\n doi = {10.1109/infcom.2009.5062142},\\n keywords = {identity aware sensor networks, source-identity-message separation, wireless sensor networks, wireless sensor networksenergy efficient},\\n month = {April},\\n note = {ISSN: 0743-166X},\\n pages = {2177--2185},\\n tags = {sensor_networks},\\n title = {Identity aware sensor networks},\\n year = {2009}\\n}\\n\\n\",\"author_short\":[\"Keller, L.\",\"Jafari Siavoshani, M.\",\"Fragouli, C.\",\"Argyraki, K.\",\"Diggavi, S. N.\"],\"key\":\"keller_identity_2009\",\"id\":\"keller_identity_2009\",\"bibbaseid\":\"keller-jafarisiavoshani-fragouli-argyraki-diggavi-identityawaresensornetworks-2009\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"identity aware sensor networks\",\"source-identity-message separation\",\"wireless sensor networks\",\"wireless sensor networksenergy efficient\"],\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"In a significant class of sensor-network applications, the identities of the reporting sensors constitute the bulk of the communicated data, whereas the message itself can be as small as a single bit—for instance, in many cases, sensors are used to detect whether and where a certain interesting condition occurred, or to track incremental environmental changes at fixed locations. In such scenarios, the traditional network-protocol paradigm of separately specifying the source identity and the message in distinct fields leads to inefficient communication. This work addresses the question of how communication should happen in such identity-aware sensor networks. We calculate theoretical performance bounds for this type of communication, where “performance” refers to the number of transmitted bits. We propose a communication protocol, where the identity and message of each source are specified jointly using subspace coding. We show through analysis and simulation that our protocol's performance is close to optimal and compare it to the performance of a traditional protocol, where identity and message are specified separately.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Keller\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Jafari\",\"Siavoshani\"],\"firstnames\":[\"Mahdi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Argyraki\"],\"firstnames\":[\"K.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]}],\"doi\":\"10.1109/JSAC.2010.100913\",\"journal\":\"IEEE JSAC on Wireless Sensor Networks\",\"tags\":\"sensor_networks\",\"title\":\"Joint identity-message coding for sensor networks\",\"year\":\"2010\",\"bibtex\":\"@article{keller_joint_2010,\\n abstract = {In a significant class of sensor-network applications, the identities of the reporting sensors constitute the bulk of the communicated data, whereas the message itself can be as small as a single bit—for instance, in many cases, sensors are used to detect whether and where a certain interesting condition occurred, or to track incremental environmental changes at fixed locations. In such scenarios, the traditional network-protocol paradigm of separately specifying the source identity and the message in distinct fields leads to inefficient communication. This work addresses the question of how communication should happen in such identity-aware sensor networks. We calculate theoretical performance bounds for this type of communication, where “performance” refers to the number of transmitted bits. We propose a communication protocol, where the identity and message of each source are specified jointly using subspace coding. We show through analysis and simulation that our protocol's performance is close to optimal and compare it to the performance of a traditional protocol, where identity and message are specified separately.},\\n type={4},\\n author = {Keller, L. and Jafari Siavoshani, Mahdi and Argyraki, K. and Fragouli, C. and Diggavi, Suhas N.},\\n doi = {10.1109/JSAC.2010.100913},\\n journal = {IEEE JSAC on Wireless Sensor Networks},\\n tags = {sensor_networks},\\n title = {Joint identity-message coding for sensor networks},\\n year = {2010}\\n}\\n\\n\",\"author_short\":[\"Keller, L.\",\"Jafari Siavoshani, M.\",\"Argyraki, K.\",\"Fragouli, C.\",\"Diggavi, S. N.\"],\"key\":\"keller_joint_2010\",\"id\":\"keller_joint_2010\",\"bibbaseid\":\"keller-jafarisiavoshani-argyraki-fragouli-diggavi-jointidentitymessagecodingforsensornetworks-2010\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"Video streaming is one of the increasingly popular, as well as demanding, applications on smartphones today. In this paper, we consider a group of smartphone users, within proximity of each other, who are interested in watching the same video from the Internet at the same time. The common practice today is that each user downloads the video independently using her own cellular connection, which often leads to poor quality. We design, implement, and evaluate a novel system, MicroCast, that uses the resources on all smartphones of the group in a cooperative way so as to improve the streaming experience. Each 4 phone uses simultaneously two network interfaces: the cellular to connect to the video server and the WiFi to connect to the rest of the group. Key ingredients of our design include the following. First, we propose a scheduling algorithm, MicroDownload, that decides which parts of the video each phone should download from the server, based on the phones’ download rate. Second, we propose a novel all-to-all local dissemination scheme, MicroNC-P2, for sharing content among group members, which outperforms state-of-the-art peer-to-peer schemes in our setting. MicroNC-P2 is designed to exploit WiFi overhearing and network coding, based on a local packet broadcast framework, MicroBroadcast, which we developed specifically for Android phones. We evaluate MicroCast on a testbed consisting of seven Android phones, and we show that it brings significant performance benefits without battery penalty.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Keller\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Le\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cici\"],\"firstnames\":[\"B.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Seferoglu\"],\"firstnames\":[\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Markopoulou\"],\"firstnames\":[\"A.\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the 10th international conference on Mobile systems, applications, and services\",\"pages\":\"57–70\",\"publisher\":\"ACM\",\"tags\":\"network_coding,wireless\",\"title\":\"Microcast: Cooperative video streaming on smartphones\",\"year\":\"2012\",\"bibtex\":\"@inproceedings{keller_microcast_2012,\\n abstract = {Video streaming is one of the increasingly popular, as well as demanding, applications on smartphones today. In this paper, we consider a group of smartphone users, within proximity of each other, who are interested in watching the same video from the Internet at the same time. The common practice today is that each user downloads the video independently using her own cellular connection, which often leads to poor quality. We design, implement, and evaluate a novel system, MicroCast, that uses the resources on all smartphones of the group in a cooperative way so as to improve the streaming experience. Each 4 phone uses simultaneously two network interfaces: the cellular to connect to the video server and the WiFi to connect to the rest of the group. Key ingredients of our design include the following. First, we propose a scheduling algorithm, MicroDownload, that decides which parts of the video each phone should download from the server, based on the phones’ download rate. Second, we propose a novel all-to-all local dissemination scheme, MicroNC-P2, for sharing content among group members, which outperforms state-of-the-art peer-to-peer schemes in our setting. MicroNC-P2 is designed to exploit WiFi overhearing and network coding, based on a local packet broadcast framework, MicroBroadcast, which we developed specifically for Android phones. We evaluate MicroCast on a testbed consisting of seven Android phones, and we show that it brings significant performance benefits without battery penalty.},\\n type={4},\\n author = {Keller, L. and Le, A. and Cici, B. and Seferoglu, H. and Fragouli, C. and Markopoulou, A.},\\n booktitle = {Proceedings of the 10th international conference on {Mobile} systems, applications, and services},\\n pages = {57--70},\\n publisher = {ACM},\\n tags = {network_coding,wireless},\\n title = {Microcast: {Cooperative} video streaming on smartphones},\\n year = {2012}\\n}\\n\\n\",\"author_short\":[\"Keller, L.\",\"Le, A.\",\"Cici, B.\",\"Seferoglu, H.\",\"Fragouli, C.\",\"Markopoulou, A.\"],\"key\":\"keller_microcast_2012\",\"id\":\"keller_microcast_2012\",\"bibbaseid\":\"keller-le-cici-seferoglu-fragouli-markopoulou-microcastcooperativevideostreamingonsmartphones-2012\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"This paper experimentally studies the reliability and delay of flooding based multicast protocols for a sniper detection application. In particular using an emulator it studies under which conditions protocols based on network coding deliver performance improvements compared to classic flooding. It then presents an implementation of such protocols on mobile phones.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Keller\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Karaagac\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Argyraki\"],\"firstnames\":[\"K.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Wireless Measurements Workshop (WinMee)\",\"month\":\"May\",\"tags\":\"network_coding,wireless\",\"title\":\"A network coding approach to the sniper detection problem\",\"year\":\"2011\",\"bibtex\":\"@inproceedings{keller_network_2011,\\n abstract = {This paper experimentally studies the reliability and delay of flooding based multicast protocols for a sniper detection application. In particular using an emulator it studies under which conditions protocols based on network coding deliver performance improvements compared to classic flooding. It then presents an implementation of such protocols on mobile phones.},\\n type={4},\\n author = {Keller, L. and Karaagac, A. and Fragouli, C. and Argyraki, K.},\\n booktitle = {{IEEE} {Wireless} {Measurements} {Workshop} ({WinMee})},\\n month = {May},\\n tags = {network_coding,wireless},\\n title = {A network coding approach to the sniper detection problem},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Keller, L.\",\"Karaagac, A.\",\"Fragouli, C.\",\"Argyraki, K.\"],\"key\":\"keller_network_2011-1\",\"id\":\"keller_network_2011-1\",\"bibbaseid\":\"keller-karaagac-fragouli-argyraki-anetworkcodingapproachtothesniperdetectionproblem-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"Consider a source broadcasting M packets to N receivers over independent erasure channels, where perfect feedback is available from the receivers to the source, and the source is allowed to use coding. We investigate offline and online algorithms that optimize delay, both through theoretical analysis as well as simulation results.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Keller\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Drinea\"],\"firstnames\":[\"Eleni\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"Network Coding, Theory and Applications, 2008. NetCod 2008. Fourth Workshop on\",\"doi\":\"10.1109/netcod.2008.4476183\",\"keywords\":\"network coding, feedback, broadcasting, encoding, online broadcasting\",\"month\":\"January\",\"pages\":\"1 – 6\",\"tags\":\"network_coding,wireless\",\"title\":\"Online Broadcasting with Network Coding\",\"year\":\"2008\",\"bibtex\":\"@inproceedings{keller_online_2008,\\n abstract = {Consider a source broadcasting M packets to N receivers over independent erasure channels, where perfect feedback is available from the receivers to the source, and the source is allowed to use coding. We investigate offline and online algorithms that optimize delay, both through theoretical analysis as well as simulation results.},\\n type={4},\\n author = {Keller, L. and Drinea, Eleni and Fragouli, C.},\\n booktitle = {Network {Coding}, {Theory} and {Applications}, 2008. {NetCod} 2008. {Fourth} {Workshop} on},\\n doi = {10.1109/netcod.2008.4476183},\\n keywords = {network coding, feedback, broadcasting, encoding, online broadcasting},\\n month = {January},\\n pages = {1 -- 6},\\n tags = {network_coding,wireless},\\n title = {Online {Broadcasting} with {Network} {Coding}},\\n year = {2008}\\n}\\n\\n\",\"author_short\":[\"Keller, L.\",\"Drinea, E.\",\"Fragouli, C.\"],\"key\":\"keller_online_2008\",\"id\":\"keller_online_2008\",\"bibbaseid\":\"keller-drinea-fragouli-onlinebroadcastingwithnetworkcoding-2008\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"network coding\",\"feedback\",\"broadcasting\",\"encoding\",\"online broadcasting\"],\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"Designing a communication protocol for sensor networks often involves obtaining the “right” trade-off between energy efficiency and reliability. In this paper, we show that network coding provides a means to elegantly balance these two goals. We present the design and implementation of SenseCode, a collection protocol for sensor networks—and, to the best of our knowledge, the first such protocol to employ network coding. SenseCode provides a way to gracefully introduce a configurable amount of redundant information in the network, thereby increasing reliability in the face of packet loss. We compare SenseCode to the best (to our knowledge) existing alternative and show that it achieves higher reliability (typically 20%, in certain cases up to 30%), while consuming the same amount of network resources. We have implemented SenseCode as a TinyOs module, and evaluate it through TOSSIM simulations, as well as a testbed of 30 TinyNode sensors deployed in our department building\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Keller\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Atsan\"],\"firstnames\":[\"Emre\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Argyraki\"],\"firstnames\":[\"K.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"EPFL Technical Report, in submission\",\"tags\":\"network_coding,sensor_networks\",\"title\":\"SenseCode: Network coding for reliable sensor networks\",\"year\":\"2009\",\"bibtex\":\"@article{keller_sensecode_2009,\\n abstract = {Designing a communication protocol for sensor networks often involves obtaining the “right” trade-off between energy efficiency and reliability. In this paper, we show that network coding provides a means to elegantly balance these two goals. We present the design and implementation of SenseCode, a collection protocol for sensor networks—and, to the best of our knowledge, the first such protocol to employ network coding. SenseCode provides a way to gracefully introduce a configurable amount of redundant information in the network, thereby increasing reliability in the face of packet loss. We compare SenseCode to the best (to our knowledge) existing alternative and show that it achieves higher reliability (typically 20\\\\%, in certain cases up to 30\\\\%), while consuming the same amount of network resources. We have implemented SenseCode as a TinyOs module, and evaluate it through TOSSIM simulations, as well as a testbed of 30 TinyNode sensors deployed in our department building},\\n type={4},\\n author = {Keller, L. and Atsan, Emre and Argyraki, K. and Fragouli, C.},\\n journal = {EPFL Technical Report, in submission},\\n tags = {network_coding,sensor_networks},\\n title = {{SenseCode}: {Network} coding for reliable sensor networks},\\n year = {2009}\\n}\\n\\n\",\"author_short\":[\"Keller, L.\",\"Atsan, E.\",\"Argyraki, K.\",\"Fragouli, C.\"],\"key\":\"keller_sensecode_2009\",\"id\":\"keller_sensecode_2009\",\"bibbaseid\":\"keller-atsan-argyraki-fragouli-sensecodenetworkcodingforreliablesensornetworks-2009\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Keller\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Atsan\"],\"firstnames\":[\"Emre\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Argyraki\"],\"firstnames\":[\"K.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Sensor Networks\",\"tags\":\"sensor_networks\",\"title\":\"SenseCode: Network Coding for Reliable Sensor Networks\",\"year\":\"2013\",\"bibtex\":\"@article{keller_sensecode_2013,\\n type={2},\\n author = {Keller, L. and Atsan, Emre and Argyraki, K. and Fragouli, C.},\\n journal = {IEEE Transactions on Sensor Networks},\\n tags = {sensor_networks},\\n title = {{SenseCode}: {Network} {Coding} for {Reliable} {Sensor} {Networks}},\\n year = {2013}\\n}\\n\\n\",\"author_short\":[\"Keller, L.\",\"Atsan, E.\",\"Argyraki, K.\",\"Fragouli, C.\"],\"key\":\"keller_sensecode_2013\",\"id\":\"keller_sensecode_2013\",\"bibbaseid\":\"keller-atsan-argyraki-fragouli-sensecodenetworkcodingforreliablesensornetworks-2013\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"This paper addresses the problem of adaptive channel tracking and equalization for multi-input multi-output (MIMO) time-variant frequency-selective channels. A finite-length minimum-mean-squared-error decision-feedback equalizer (MMSE-DFE) performs the equalization task, while a Kalman filter tracks the MIMO channel, which models the corrupting effects of inter-symbol interference (ISI), inter-user interference (IUI), and noise. The Kalman tracking is aided by previous hard decisions produced by the DFE, with a decision delay &gt;0, which causes the Kalman filter to track the channel with a delay. A channel prediction module bridges the time gap between the channel estimates produced by the Kalman filter and those needed for the DFE adaptation. The proposed algorithm offers good tracking behavior for multi-user fading ISI channels at the expense of higher complexity.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Komninakis\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Sayed\"],\"firstnames\":[\"A.\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wesel\"],\"firstnames\":[\"R.\",\"D.\"],\"suffixes\":[]}],\"journal\":\"ICC 2000, New Orleans, Louisiana, June 18-22\",\"pages\":\"pages 1655–1659\",\"tags\":\"wireless\",\"title\":\"Adaptive Multi-Input Multi-Output Fading Channel Equalization using Kalman Estimation\",\"volume\":\"vol. 3\",\"year\":\"2000\",\"bibtex\":\"@article{komninakis_adaptive_2000,\\n abstract = {This paper addresses the problem of adaptive channel tracking and equalization for multi-input multi-output (MIMO) time-variant frequency-selective channels. A finite-length minimum-mean-squared-error decision-feedback equalizer (MMSE-DFE) performs the equalization task, while a Kalman filter tracks the MIMO channel, which models the corrupting effects of inter-symbol interference (ISI), inter-user interference (IUI), and noise. The Kalman tracking is aided by previous hard decisions produced by the DFE, with a decision delay \\\\&gt;0, which causes the Kalman filter to track the channel with a delay. A channel prediction module bridges the time gap between the channel estimates produced by the Kalman filter and those needed for the DFE adaptation. The proposed algorithm offers good tracking behavior for multi-user fading ISI channels at the expense of higher complexity.},\\n type={4},\\n author = {Komninakis, C. and Fragouli, C. and Sayed, A. H. and Wesel, R. D.},\\n journal = {ICC 2000, New Orleans, Louisiana, June 18-22},\\n pages = {pages 1655--1659},\\n tags = {wireless},\\n title = {Adaptive {Multi}-{Input} {Multi}-{Output} {Fading} {Channel} {Equalization} using {Kalman} {Estimation}},\\n volume = {vol. 3},\\n year = {2000}\\n}\\n\\n\",\"author_short\":[\"Komninakis, C.\",\"Fragouli, C.\",\"Sayed, A. H.\",\"Wesel, R. D.\"],\"key\":\"komninakis_adaptive_2000\",\"id\":\"komninakis_adaptive_2000\",\"bibbaseid\":\"komninakis-fragouli-sayed-wesel-adaptivemultiinputmultioutputfadingchannelequalizationusingkalmanestimation-2000\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"This paper addresses the problem of training sequence design for multiple-antenna transmissions over quasi-static frequency-selective channels. To achieve the channel estimation minimum mean square error, the training sequences transmitted from the multiple antennas must have impulse-like auto correlation and zero cross correlation. We reduce the problem of designing multiple training sequences to the much easier and well-understood problem of designing a single training sequence with impulse-like auto correlation. To this end, we propose to encode the training symbols with a space-time code, that may be the same or different from the space-time code that encodes the information symbols. Optimal sequences do not exist for all training sequence lengths and constellation alphabets. We also propose a method to easily identify training sequences that belong to a standard 2m-PSK constellation for an arbitrary training sequence length and an arbitrary number of unknown channel taps. Performance bounds derived indicate that these sequences achieve near-optimum performance.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Komninakis\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wesel\"],\"firstnames\":[\"R.\",\"D.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Sayed\"],\"firstnames\":[\"A.\",\"H.\"],\"suffixes\":[]}],\"journal\":\"33rd Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, October 24-27\",\"tags\":\"wireless\",\"title\":\"Channel estimation and equalization in fading\",\"year\":\"1999\",\"bibtex\":\"@article{komninakis_channel_1999,\\n abstract = {This paper addresses the problem of training sequence design for multiple-antenna transmissions over quasi-static frequency-selective channels. To achieve the channel estimation minimum mean square error, the training sequences transmitted from the multiple antennas must have impulse-like auto correlation and zero cross correlation. We reduce the problem of designing multiple training sequences to the much easier and well-understood problem of designing a single training sequence with impulse-like auto correlation. To this end, we propose to encode the training symbols with a space-time code, that may be the same or different from the space-time code that encodes the information symbols. Optimal sequences do not exist for all training sequence lengths and constellation alphabets. We also propose a method to easily identify training sequences that belong to a standard 2m-PSK constellation for an arbitrary training sequence length and an arbitrary number of unknown channel taps. Performance bounds derived indicate that these sequences achieve near-optimum performance.},\\n type={4},\\n author = {Komninakis, C. and Fragouli, C. and Wesel, R. D. and Sayed, A. H.},\\n journal = {33rd Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, October 24-27},\\n tags = {wireless},\\n title = {Channel estimation and equalization in fading},\\n year = {1999}\\n}\\n\\n\",\"author_short\":[\"Komninakis, C.\",\"Fragouli, C.\",\"Wesel, R. D.\",\"Sayed, A. H.\"],\"key\":\"komninakis_channel_1999\",\"id\":\"komninakis_channel_1999\",\"bibbaseid\":\"komninakis-fragouli-wesel-sayed-channelestimationandequalizationinfading-1999\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"This paper addresses the problem of channel tracking and equalization for multi-input multi-output (MIMO) time-varying frequency-selective channels. These channels model the effects of inter-symbol interference (ISI), co-channel interference (CCI), and noise. A low-order autoregressive model approximates the MIMO channel variation and facilitates tracking via a Kalman filter. Hard decisions to aid Kalman tracking come from a MIMO finite-length minimum-mean-squared-error decision-feedback equalizer (MMSE-DFE), which performs the equalization task. Since the optimum DFE for a wide range of channels produces decisions with a delay &gt; 0, the Kalman filter tracks the channel with a delay. A channel prediction module bridges the time gap between the channel estimates produced by the Kalman filter and those needed for the DFE adaptation. The proposed algorithm offers good tracking behavior for multiuser fading ISI channels at the expense of higher complexity than conventional adaptive algorithms. Applications include synchronous multiuser detection of independent transmitters, as well as coordinated transmission through many transmitter/receiver antennas, for increased data rate.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Komninakis\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Sayed\"],\"firstnames\":[\"A.\",\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wesel\"],\"firstnames\":[\"R.\",\"D.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Signal Processing\",\"pages\":\"pages 1065–1076\",\"tags\":\"wireless\",\"title\":\"Multi-Input Multi-Output Fading Channel Tracking and Equalization using Kalman Estimation\",\"volume\":\"vol. 50\",\"year\":\"2002\",\"bibtex\":\"@article{komninakis_multi-input_2002,\\n abstract = {This paper addresses the problem of channel tracking and equalization for multi-input multi-output (MIMO) time-varying frequency-selective channels. These channels model the effects of inter-symbol interference (ISI), co-channel interference (CCI), and noise. A low-order autoregressive model approximates the MIMO channel variation and facilitates tracking via a Kalman filter. Hard decisions to aid Kalman tracking come from a MIMO finite-length minimum-mean-squared-error decision-feedback equalizer (MMSE-DFE), which performs the equalization task. Since the optimum DFE for a wide range of channels produces decisions with a delay \\\\&gt; 0, the Kalman filter tracks the channel with a delay. A channel prediction module bridges the time gap between the channel estimates produced by the Kalman filter and those needed for the DFE adaptation. The proposed algorithm offers good tracking behavior for multiuser fading ISI channels at the expense of higher complexity than conventional adaptive algorithms. Applications include synchronous multiuser detection of independent transmitters, as well as coordinated transmission through many transmitter/receiver antennas, for increased data rate.},\\n type={2},\\n author = {Komninakis, C. and Fragouli, C. and Sayed, A. H. and Wesel, R. D.},\\n journal = {IEEE Transactions on Signal Processing},\\n pages = {pages 1065--1076},\\n tags = {wireless},\\n title = {Multi-{Input} {Multi}-{Output} {Fading} {Channel} {Tracking} and {Equalization} using {Kalman} {Estimation}},\\n volume = {vol. 50},\\n year = {2002}\\n}\\n\\n\",\"author_short\":[\"Komninakis, C.\",\"Fragouli, C.\",\"Sayed, A. H.\",\"Wesel, R. D.\"],\"key\":\"komninakis_multi-input_2002\",\"id\":\"komninakis_multi-input_2002\",\"bibbaseid\":\"komninakis-fragouli-sayed-wesel-multiinputmultioutputfadingchanneltrackingandequalizationusingkalmanestimation-2002\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Le\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Keller\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Seferoglu\"],\"firstnames\":[\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cici\"],\"firstnames\":[\"B.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Markopoulou\"],\"firstnames\":[\"A.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Networking\",\"tags\":\"network_coding,wireless\",\"title\":\"MicroCast: Cooperative Video Streaming using Cellular and Local Connections\",\"year\":\"2015\",\"bibtex\":\"@article{le_microcast_2015,\\n type={2},\\n author = {Le, A. and Keller, L. and Seferoglu, H. and Cici, B. and Fragouli, C. and Markopoulou, A.},\\n journal = {IEEE Transactions on Networking},\\n tags = {network_coding,wireless},\\n title = {{MicroCast}: {Cooperative} {Video} {Streaming} using {Cellular} and {Local} {Connections}},\\n year = {2015}\\n}\\n\\n\",\"author_short\":[\"Le, A.\",\"Keller, L.\",\"Seferoglu, H.\",\"Cici, B.\",\"Fragouli, C.\",\"Markopoulou, A.\"],\"key\":\"le_microcast_2015\",\"id\":\"le_microcast_2015\",\"bibbaseid\":\"le-keller-seferoglu-cici-fragouli-markopoulou-microcastcooperativevideostreamingusingcellularandlocalconnections-2015\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"Smartphones are an ideal platform for local multiplayer games, thanks to their computational and networking capabilities as well as their popularity and portability. However, existing game engines do not exploit the locality of players to improve game latency. In this paper, we propose MicroPlay, a complete networking framework for local multiplayer mobile games. To the best of our knowledge, this is the first framework that exploits local connections between smartphones, and in particular, the broadcast nature of the wireless medium, to provide smooth, accurate rendering of all players with two desired properties. First, it performs direct-input rendering (i.e., without any inter- or extrapo- lation of game state) for all players; second, it provides very low game latency. We implement a MicroPlay prototype on Android phones, as well as an example multiplayer car racing game, called Racer, in order to demonstrate MicroPlay’s capabilities. Our experiments show that cars can be rendered smoothly, without any prediction of state, and with only 20–30 ms game latency.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Le\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Keller\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Markopoulou\"],\"firstnames\":[\"A.\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the first ACM international workshop on Mobile gaming\",\"pages\":\"13–18\",\"publisher\":\"ACM\",\"tags\":\"network_coding,wireless\",\"title\":\"MicroPlay: a networking framework for local multiplayer games\",\"year\":\"2012\",\"bibtex\":\"@inproceedings{le_microplay_2012,\\n abstract = {Smartphones are an ideal platform for local multiplayer games, thanks to their computational and networking capabilities as well as their popularity and portability. However, existing game engines do not exploit the locality of players to improve game latency. In this paper, we propose MicroPlay, a complete networking framework for local multiplayer mobile games. To the best of our knowledge, this is the first framework that exploits local connections between smartphones, and in particular, the broadcast nature of the wireless medium, to provide smooth, accurate rendering of all players with two desired properties. First, it performs direct-input rendering (i.e., without any inter- or extrapo- lation of game state) for all players; second, it provides very low game latency. We implement a MicroPlay prototype on Android phones, as well as an example multiplayer car racing game, called Racer, in order to demonstrate MicroPlay’s capabilities. Our experiments show that cars can be rendered smoothly, without any prediction of state, and with only 20–30 ms game latency.},\\n type={4},\\n author = {Le, A. and Keller, L. and Fragouli, C. and Markopoulou, A.},\\n booktitle = {Proceedings of the first {ACM} international workshop on {Mobile} gaming},\\n pages = {13--18},\\n publisher = {ACM},\\n tags = {network_coding,wireless},\\n title = {{MicroPlay}: a networking framework for local multiplayer games},\\n year = {2012}\\n}\\n\\n\",\"author_short\":[\"Le, A.\",\"Keller, L.\",\"Fragouli, C.\",\"Markopoulou, A.\"],\"key\":\"le_microplay_2012\",\"id\":\"le_microplay_2012\",\"bibbaseid\":\"le-keller-fragouli-markopoulou-microplayanetworkingframeworkforlocalmultiplayergames-2012\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"Energy efficiency, which directly affects battery life and portability, is perhaps the single most important design metric in hand-held computing devices capable of mobile networking over wireless radio links. By virtue of their being relatively thin clients, a high fraction of the power consumption in portable wireless computing devices is accounted for by the transport of packet data over the wireless link. In particular, the error control strategy (eg. convolutional and block channel coding for forward error correction (FEC), ARQ protocols, hybrids) used for wireless link data transport has a direct impact on battery power consumption. Error control has traditionally been studied by channel coding researchers from the perspective of selecting an error control scheme to achieve a desired level of radio channel performance. We instead study the problem of error control from a perspective more relevant to battery operated devices: the amount of battery energy consumed to transmit bits across a wireless link. This includes both the physical transmission of useful and redundancy data, as well as the computation of the error control redundancy. We first describe a novel error control where the most battery energy efficient hybrid combination of an appropriate FEQ and ARQ protocol is chosen, and adapted over time, for each stream (ATM virtual circuit or IP/RSVP flow). Next, we present analysis and simulation results to guide the selection and adaptation of the most energy efficient error control scheme as a function of quality of service, packet size, and channel state.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Lettieri\"],\"firstnames\":[\"P.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Srivastava\"],\"firstnames\":[\"M.\",\"B.\"],\"suffixes\":[]}],\"doi\":\"10.1145/262116.262142\",\"journal\":\"ACM/IEEE Mobicom\",\"pages\":\"139–150\",\"tags\":\"wireless\",\"title\":\"Low power error control for wireless links\",\"year\":\"1997\",\"bibtex\":\"@article{lettieri_low_1997,\\n abstract = {Energy efficiency, which directly affects battery life and portability, is perhaps the single most important design metric in hand-held computing devices capable of mobile networking over wireless radio links. By virtue of their being relatively thin clients, a high fraction of the power consumption in portable wireless computing devices is accounted for by the transport of packet data over the wireless link. In particular, the error control strategy (eg. convolutional and block channel coding for forward error correction (FEC), ARQ protocols, hybrids) used for wireless link data transport has a direct impact on battery power consumption. Error control has traditionally been studied by channel coding researchers from the perspective of selecting an error control scheme to achieve a desired level of radio channel performance. We instead study the problem of error control from a perspective more relevant to battery operated devices: the amount of battery energy consumed to transmit bits across a wireless link. This includes both the physical transmission of useful and redundancy data, as well as the computation of the error control redundancy. We first describe a novel error control where the most battery energy efficient hybrid combination of an appropriate FEQ and ARQ protocol is chosen, and adapted over time, for each stream (ATM virtual circuit or IP/RSVP flow). Next, we present analysis and simulation results to guide the selection and adaptation of the most energy efficient error control scheme as a function of quality of service, packet size, and channel state.},\\n type={4},\\n author = {Lettieri, P. and Fragouli, C. and Srivastava, M. B.},\\n doi = {10.1145/262116.262142},\\n journal = {ACM/IEEE Mobicom},\\n pages = {139--150},\\n tags = {wireless},\\n title = {Low power error control for wireless links},\\n year = {1997}\\n}\\n\\n\",\"author_short\":[\"Lettieri, P.\",\"Fragouli, C.\",\"Srivastava, M. B.\"],\"key\":\"lettieri_low_1997\",\"id\":\"lettieri_low_1997\",\"bibbaseid\":\"lettieri-fragouli-srivastava-lowpowererrorcontrolforwirelesslinks-1997\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"We consider the problem of finding the minimum number of transmissions in an ad-hoc network for all-to-all broadcasting using network coding. This work generalizes previous results for canonical topologies such as the circle and the wrap around grid to the finite-sized line, and non-wrap-around grid. The latter topologies better reflect network coding in random topologies, since the dissemination of information is \\\"directional\\\", in a sense that information usually arrives via the neighbors on the path to its originator instead of from all possible directions. We find that while the line topology requires a higher number of transmissions compared to the circle, this is interestingly not the case for the grid. We further present simulation results on a heuristic that estimates the required minimum number of transmissions in random wireless topologies and compare it to the optimum solution, as well as previously proposed heuristics.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Loyola\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Souza\"],\"firstnames\":[\"T.\",\"De\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Widmer\"],\"firstnames\":[\"J.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"Network Coding Workshop: Theory and Applications\",\"tags\":\"network_coding,wireless\",\"title\":\"Network-coded broadcast: from canonical networks to random topologies\",\"year\":\"2008\",\"bibtex\":\"@article{loyola_network-coded_2008,\\n abstract = {We consider the problem of finding the minimum number of transmissions in an ad-hoc network for all-to-all broadcasting using network coding. This work generalizes previous results for canonical topologies such as the circle and the wrap around grid to the finite-sized line, and non-wrap-around grid. The latter topologies better reflect network coding in random topologies, since the dissemination of information is \\\"directional\\\", in a sense that information usually arrives via the neighbors on the path to its originator instead of from all possible directions. We find that while the line topology requires a higher number of transmissions compared to the circle, this is interestingly not the case for the grid. We further present simulation results on a heuristic that estimates the required minimum number of transmissions in random wireless topologies and compare it to the optimum solution, as well as previously proposed heuristics.},\\n type={4},\\n author = {Loyola, L. and Souza, T. De and Widmer, J. and Fragouli, C.},\\n journal = {Network Coding Workshop: Theory and Applications},\\n tags = {network_coding,wireless},\\n title = {Network-coded broadcast: from canonical networks to random topologies},\\n year = {2008}\\n}\\n\\n\",\"author_short\":[\"Loyola, L.\",\"Souza, T. D.\",\"Widmer, J.\",\"Fragouli, C.\"],\"key\":\"loyola_network-coded_2008\",\"id\":\"loyola_network-coded_2008\",\"bibbaseid\":\"loyola-souza-widmer-fragouli-networkcodedbroadcastfromcanonicalnetworkstorandomtopologies-2008\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"We consider the following packet coding scheme: The coding node has a fixed, finite memory in which it stores packets formed from an incoming packet stream, and it sends packets formed from random linear combinations of its memory contents. We analyze the scheme in two settings: as a self-contained component in a network providing reliability on a single link, and as a component employed at intermediate nodes in a block-coded end-to-end connection. We believe that the scheme is a good alternative to automatic repeat request when feedback is too slow, too unreliable, or too difficult to implement.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Lun\"],\"firstnames\":[\"D.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Pakzad\"],\"firstnames\":[\"P.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Medard\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Koetter\"],\"firstnames\":[\"R.\"],\"suffixes\":[]}],\"journal\":\"2nd Network Coding Workshop\",\"tags\":\"network_coding\",\"title\":\"An Analysis of Finite-Memory Random Linear Coding on Packet Streams\",\"year\":\"2006\",\"bibtex\":\"@article{lun_analysis_2006,\\n abstract = {We consider the following packet coding scheme: The coding node has a fixed, finite memory in which it stores packets formed from an incoming packet stream, and it sends packets formed from random linear combinations of its memory contents. We analyze the scheme in two settings: as a self-contained component in a network providing reliability on a single link, and as a component employed at intermediate nodes in a block-coded end-to-end connection. We believe that the scheme is a good alternative to automatic repeat request when feedback is too slow, too unreliable, or too difficult to implement.},\\n type={4},\\n author = {Lun, D. and Pakzad, P. and Fragouli, C. and Medard, M. and Koetter, R.},\\n journal = {2nd Network Coding Workshop},\\n tags = {network_coding},\\n title = {An {Analysis} of {Finite}-{Memory} {Random} {Linear} {Coding} on {Packet} {Streams}},\\n year = {2006}\\n}\\n\\n\",\"author_short\":[\"Lun, D.\",\"Pakzad, P.\",\"Fragouli, C.\",\"Medard, M.\",\"Koetter, R.\"],\"key\":\"lun_analysis_2006\",\"id\":\"lun_analysis_2006\",\"bibbaseid\":\"lun-pakzad-fragouli-medard-koetter-ananalysisoffinitememoryrandomlinearcodingonpacketstreams-2006\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Mao\"],\"firstnames\":[\"Y\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tabuada\"],\"firstnames\":[\"P.\"],\"suffixes\":[]}],\"journal\":\"IEEE Control Systems Letters\",\"tags\":\"security\",\"title\":\"Secure State-Reconstruction Over Networks Subject to Attacks\",\"year\":\"2020\",\"bibtex\":\"@article{mao_secure_2020,\\n type={4},\\n author = {Mao, Y and Diggavi, S. and Fragouli, C. and Tabuada, P.},\\n journal = {IEEE Control Systems Letters},\\n tags = {security},\\n title = {Secure {State}-{Reconstruction} {Over} {Networks} {Subject} to {Attacks}},\\n year = {2020}\\n}\\n\\n\",\"author_short\":[\"Mao, Y\",\"Diggavi, S.\",\"Fragouli, C.\",\"Tabuada, P.\"],\"key\":\"mao_secure_2020\",\"id\":\"mao_secure_2020\",\"bibbaseid\":\"mao-diggavi-fragouli-tabuada-securestatereconstructionovernetworkssubjecttoattacks-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Markopoulou\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Gjoka\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"tags\":\"network_coding\",\"title\":\"A network coding approach to network tomography\",\"year\":\"2013\",\"bibtex\":\"@article{markopoulou_network_2013,\\n type={2},\\n author = {Markopoulou, A. and Gjoka, M. and Fragouli, C.},\\n journal = {IEEE Transactions on Information Theory},\\n tags = {network_coding},\\n title = {A network coding approach to network tomography},\\n year = {2013}\\n}\\n\\n\",\"author_short\":[\"Markopoulou, A.\",\"Gjoka, M.\",\"Fragouli, C.\"],\"key\":\"markopoulou_network_2013\",\"id\":\"markopoulou_network_2013\",\"bibbaseid\":\"markopoulou-gjoka-fragouli-anetworkcodingapproachtonetworktomography-2013\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Mohajer\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tse\"],\"firstnames\":[\"D.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"tags\":\"network_coding\",\"title\":\"Approximate capacity of a class of gaussian interference-relay networks\",\"year\":\"2009\",\"bibtex\":\"@article{mohajer_approximate_2009,\\n type={2},\\n author = {Mohajer, S. and Diggavi, Suhas N. and Fragouli, C. and Tse, D.},\\n journal = {IEEE Transactions on Information Theory},\\n tags = {network_coding},\\n title = {Approximate capacity of a class of gaussian interference-relay networks},\\n year = {2009}\\n}\\n\\n\",\"author_short\":[\"Mohajer, S.\",\"Diggavi, S. N.\",\"Fragouli, C.\",\"Tse, D.\"],\"key\":\"mohajer_approximate_2009\",\"id\":\"mohajer_approximate_2009\",\"bibbaseid\":\"mohajer-diggavi-fragouli-tse-approximatecapacityofaclassofgaussianinterferencerelaynetworks-2009\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Mohajer\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tse\"],\"firstnames\":[\"D.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"month\":\"May\",\"number\":\"5\",\"pages\":\"2837–2864\",\"tags\":\"wireless\",\"title\":\"Approximate capacity of a class of relay-interference networks\",\"volume\":\"57\",\"year\":\"2011\",\"bibtex\":\"@article{mohajer_approximate_2011,\\n type={2},\\n author = {Mohajer, S. and Diggavi, Suhas N. and Fragouli, C. and Tse, D.},\\n journal = {IEEE Transactions on Information Theory},\\n month = {May},\\n number = {5},\\n pages = {2837--2864},\\n tags = {wireless},\\n title = {Approximate capacity of a class of relay-interference networks},\\n volume = {57},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Mohajer, S.\",\"Diggavi, S. N.\",\"Fragouli, C.\",\"Tse, D.\"],\"key\":\"mohajer_approximate_2011\",\"id\":\"mohajer_approximate_2011\",\"bibbaseid\":\"mohajer-diggavi-fragouli-tse-approximatecapacityofaclassofrelayinterferencenetworks-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"The wireless multiple-unicast problem is considered over a layered network, where the rates of transmission are limited by the relaying and interference effect. The deterministic model introduced is used to capture the broadcasting and multiple access effects. The capacity region of the Z-chain relay-interference network is fully characterized. In order to solve the problem, we introduce a new achievability scheme based on ldquointerference neutralizationrdquo and a new analysis technique to bound the number of non-interfering (pure) signals\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Mohajer\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tse\"],\"firstnames\":[\"D.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Information Theory Workshop (ITW)\",\"tags\":\"network_coding,wireless\",\"title\":\"Capacity of deterministic Z-chain relay-interference network\",\"year\":\"2009\",\"bibtex\":\"@inproceedings{mohajer_capacity_2009,\\n abstract = {The wireless multiple-unicast problem is considered over a layered network, where the rates of transmission are limited by the relaying and interference effect. The deterministic model introduced is used to capture the broadcasting and multiple access effects. The capacity region of the Z-chain relay-interference network is fully characterized. In order to solve the problem, we introduce a new achievability scheme based on ldquointerference neutralizationrdquo and a new analysis technique to bound the number of non-interfering (pure) signals},\\n type={4},\\n author = {Mohajer, S. and Diggavi, Suhas N. and Fragouli, C. and Tse, D.},\\n booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},\\n tags = {network_coding,wireless},\\n title = {Capacity of deterministic {Z}-chain relay-interference network},\\n year = {2009}\\n}\\n\\n\",\"author_short\":[\"Mohajer, S.\",\"Diggavi, S. N.\",\"Fragouli, C.\",\"Tse, D.\"],\"key\":\"mohajer_capacity_2009\",\"id\":\"mohajer_capacity_2009\",\"bibbaseid\":\"mohajer-diggavi-fragouli-tse-capacityofdeterministiczchainrelayinterferencenetwork-2009\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"We consider multisource non-coherent network coding, where multiple sources send information to one or multiple receivers. We prove that this is equivalent to a ldquosubspacerdquo channel, that takes subspaces as inputs and outputs. We then show that the rate of each individual receiver is upper bounded as deltai(T - delta1 - delta2), where deltai is what we define to be the ldquodominatingrdquo dimension in the subspace codebook of source i, and T is the ldquocoherencerdquo time of the network.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Mohajer\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Jafari\",\"Siavoshani\"],\"firstnames\":[\"Mahdi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"Networking and Information Theory, 2009. ITW 2009. IEEE Information Theory Workshop on\",\"doi\":\"10.1109/itwnit.2009.5158556\",\"keywords\":\"channel capacity, channel codingchannel capacity, multisource noncoherent network coding, subspace codebook\",\"month\":\"June\",\"pages\":\"130–134\",\"tags\":\"network_coding,wireless\",\"title\":\"On the capacity of multisource non-coherent network coding\",\"year\":\"2009\",\"bibtex\":\"@inproceedings{mohajer_capacity_2009-1,\\n abstract = {We consider multisource non-coherent network coding, where multiple sources send information to one or multiple receivers. We prove that this is equivalent to a ldquosubspacerdquo channel, that takes subspaces as inputs and outputs. We then show that the rate of each individual receiver is upper bounded as deltai(T - delta1 - delta2), where deltai is what we define to be the ldquodominatingrdquo dimension in the subspace codebook of source i, and T is the ldquocoherencerdquo time of the network.},\\n type={4},\\n author = {Mohajer, S. and Jafari Siavoshani, Mahdi and Diggavi, Suhas N. and Fragouli, C.},\\n booktitle = {Networking and {Information} {Theory}, 2009. {ITW} 2009. {IEEE} {Information} {Theory} {Workshop} on},\\n doi = {10.1109/itwnit.2009.5158556},\\n keywords = {channel capacity, channel codingchannel capacity, multisource noncoherent network coding, subspace codebook},\\n month = {June},\\n pages = {130--134},\\n tags = {network_coding,wireless},\\n title = {On the capacity of multisource non-coherent network coding},\\n year = {2009}\\n}\\n\\n\",\"author_short\":[\"Mohajer, S.\",\"Jafari Siavoshani, M.\",\"Diggavi, S. N.\",\"Fragouli, C.\"],\"key\":\"mohajer_capacity_2009-1\",\"id\":\"mohajer_capacity_2009-1\",\"bibbaseid\":\"mohajer-jafarisiavoshani-diggavi-fragouli-onthecapacityofmultisourcenoncoherentnetworkcoding-2009\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"channel capacity\",\"channel codingchannel capacity\",\"multisource noncoherent network coding\",\"subspace codebook\"],\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"In this paper we study the relay-interference wireless network, in which relay (helper) nodes are to facilitate competing information flows over a wireless network. We examine this in the context of a deterministic wireless interaction model, which eliminates the channel noise and focuses on the signal interactions. Using this model, we show that almost all the known schemes such as interference suppression, interference alignment and interference separation are necessary for relay-interference networks. In addition, we discover a new interference management technique, which we call interference neutralization, which allows for over-the-air interference removal, without the transmitters having complete access the interfering signals. We show that interference separation, suppression, and neutralization arise in a fundamental manner, since we show complete characterizations for special configurations of the relay-interference network.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Mohajer\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tse\"],\"firstnames\":[\"D.\"],\"suffixes\":[]}],\"journal\":\"IEEE Allerton\",\"tags\":\"network_coding,wireless\",\"title\":\"Transmission techniques for relay-interference networks\",\"year\":\"2008\",\"bibtex\":\"@article{mohajer_transmission_2008,\\n abstract = {In this paper we study the relay-interference wireless network, in which relay (helper) nodes are to facilitate competing information flows over a wireless network. We examine this in the context of a deterministic wireless interaction model, which eliminates the channel noise and focuses on the signal interactions. Using this model, we show that almost all the known schemes such as interference suppression, interference alignment and interference separation are necessary for relay-interference networks. In addition, we discover a new interference management technique, which we call interference neutralization, which allows for over-the-air interference removal, without the transmitters having complete access the interfering signals. We show that interference separation, suppression, and neutralization arise in a fundamental manner, since we show complete characterizations for special configurations of the relay-interference network.},\\n type={4},\\n author = {Mohajer, S. and Diggavi, Suhas N. and Fragouli, C. and Tse, D.},\\n journal = {IEEE Allerton},\\n tags = {network_coding,wireless},\\n title = {Transmission techniques for relay-interference networks},\\n year = {2008}\\n}\\n\\n\",\"author_short\":[\"Mohajer, S.\",\"Diggavi, S. N.\",\"Fragouli, C.\",\"Tse, D.\"],\"key\":\"mohajer_transmission_2008\",\"id\":\"mohajer_transmission_2008\",\"bibbaseid\":\"mohajer-diggavi-fragouli-tse-transmissiontechniquesforrelayinterferencenetworks-2008\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Nazaroglu\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ozgur\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ebrahimi\"],\"firstnames\":[\"Javad\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"month\":\"August\",\"tags\":\"wireless\",\"title\":\"Network simplification: the Gaussian diamond network with Multiple Antennas\",\"year\":\"2011\",\"bibtex\":\"@inproceedings{nazaroglu_network_2011,\\n type={4},\\n author = {Nazaroglu, C. and Ozgur, A. and Ebrahimi, Javad and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n month = {August},\\n tags = {wireless},\\n title = {Network simplification: the {Gaussian} diamond network with {Multiple} {Antennas}},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Nazaroglu, C.\",\"Ozgur, A.\",\"Ebrahimi, J.\",\"Fragouli, C.\"],\"key\":\"nazaroglu_network_2011\",\"id\":\"nazaroglu_network_2011\",\"bibbaseid\":\"nazaroglu-ozgur-ebrahimi-fragouli-networksimplificationthegaussiandiamondnetworkwithmultipleantennas-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Nazaroglu\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ozgur\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"tags\":\"wireless\",\"title\":\"Wireless network simplification: the Gaussian N-Relay diamond network\",\"year\":\"2014\",\"bibtex\":\"@article{nazaroglu_wireless_2014,\\n type={2},\\n author = {Nazaroglu, C. and Ozgur, A. and Fragouli, C.},\\n journal = {IEEE Transactions on Information Theory},\\n tags = {wireless},\\n title = {Wireless network simplification: the {Gaussian} {N}-{Relay} diamond network},\\n year = {2014}\\n}\\n\\n\",\"author_short\":[\"Nazaroglu, C.\",\"Ozgur, A.\",\"Fragouli, C.\"],\"key\":\"nazaroglu_wireless_2014\",\"id\":\"nazaroglu_wireless_2014\",\"bibbaseid\":\"nazaroglu-ozgur-fragouli-wirelessnetworksimplificationthegaussiannrelaydiamondnetwork-2014\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Neuberg\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Papadimitratos\"],\"firstnames\":[\"P.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Urbanke\"],\"firstnames\":[\"R.\"],\"suffixes\":[]}],\"booktitle\":\"CISS\",\"month\":\"March\",\"tags\":\"security\",\"title\":\"A mobile world of security\",\"year\":\"2011\",\"bibtex\":\"@inproceedings{neuberg_mobile_2011,\\n type={4},\\n author = {Neuberg, C. and Papadimitratos, P. and Fragouli, C. and Urbanke, R.},\\n booktitle = {{CISS}},\\n month = {March},\\n tags = {security},\\n title = {A mobile world of security},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Neuberg, C.\",\"Papadimitratos, P.\",\"Fragouli, C.\",\"Urbanke, R.\"],\"key\":\"neuberg_mobile_2011\",\"id\":\"neuberg_mobile_2011\",\"bibbaseid\":\"neuberg-papadimitratos-fragouli-urbanke-amobileworldofsecurity-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"We consider communication through a cascade of discrete memoryless channels (DMCs). The source and destination node of this cascade are allowed to use coding schemes of arbitrary complexity, but the intermediate relay nodes are restricted to process only blocks of a fixed length. We investigate how the processing at the relays must be chosen in order to maximize the capacity of the cascade, that is, the maximum achievable end-to-end rate between the source and the destination. For infinite cascades with fixed intermediate processing length at the relays, we prove that this intermediate processing can be chosen to be identical without loss of optimality, and that the capacity of the cascade coincides with the rate of the best zero-error code of length equal to the block length of the intermediate processing. We further show that for fixed and identical intermediate processing at all relays, convergence of capacity as the length of the cascade goes to infinity is exponentially fast. Finally, we characterize how the block length of the intermediate processing must scale with the length of the cascade to guarantee a constant end-to-end rate. We prove that it is sufficient that the block length scales logarithmically with the network length in order to achieve any rate above the zero-error capacity. We show that in many cases of interest logarithmic growth is also necessary\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Niesen\"],\"firstnames\":[\"U.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tuninetti\"],\"firstnames\":[\"D.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"pages\":\"4039–4058\",\"tags\":\"network_coding\",\"title\":\"On the capacity of line networks\",\"volume\":\"53\",\"year\":\"2007\",\"bibtex\":\"@article{niesen_capacity_2007,\\n abstract = {We consider communication through a cascade of discrete memoryless channels (DMCs). The source and destination node of this cascade are allowed to use coding schemes of arbitrary complexity, but the intermediate relay nodes are restricted to process only blocks of a fixed length. We investigate how the processing at the relays must be chosen in order to maximize the capacity of the cascade, that is, the maximum achievable end-to-end rate between the source and the destination. For infinite cascades with fixed intermediate processing length at the relays, we prove that this intermediate processing can be chosen to be identical without loss of optimality, and that the capacity of the cascade coincides with the rate of the best zero-error code of length equal to the block length of the intermediate processing. We further show that for fixed and identical intermediate processing at all relays, convergence of capacity as the length of the cascade goes to infinity is exponentially fast. Finally, we characterize how the block length of the intermediate processing must scale with the length of the cascade to guarantee a constant end-to-end rate. We prove that it is sufficient that the block length scales logarithmically with the network length in order to achieve any rate above the zero-error capacity. We show that in many cases of interest logarithmic growth is also necessary},\\n type={2},\\n author = {Niesen, U. and Fragouli, C. and Tuninetti, D.},\\n journal = {IEEE Transactions on Information Theory},\\n pages = {4039--4058},\\n tags = {network_coding},\\n title = {On the capacity of line networks},\\n volume = {53},\\n year = {2007}\\n}\\n\\n\",\"author_short\":[\"Niesen, U.\",\"Fragouli, C.\",\"Tuninetti, D.\"],\"key\":\"niesen_capacity_2007\",\"id\":\"niesen_capacity_2007\",\"bibbaseid\":\"niesen-fragouli-tuninetti-onthecapacityoflinenetworks-2007\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"We consider communication through an infinite cascade of identical discrete memoryless channels. We allow the source and destination nodes to use coding schemes of arbitrary complexity, but restrict the intermediate (relay) nodes to process blocks of a fixed blocklength. We calculate the optimal end-to-end rate, maximized over all possible processings at the relays, and show that it coincides with the end-to-end zero-error capacity. The optimal processing is shown to be identical at each relay and to correspond to a zero-error code. We also show that the rate of convergence to the asymptotic value is exponential in the length of the cascade.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Niesen\"],\"firstnames\":[\"U.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tuninetti\"],\"firstnames\":[\"D.\"],\"suffixes\":[]}],\"journal\":\"Allerton\",\"tags\":\"network_coding\",\"title\":\"On cascaded channels with finite complexity processing at intermediate nodes\",\"year\":\"2005\",\"bibtex\":\"@article{niesen_cascaded_2005,\\n abstract = {We consider communication through an infinite cascade of identical discrete memoryless channels. We allow the source and destination nodes to use coding schemes of arbitrary complexity, but restrict the intermediate (relay) nodes to process blocks of a fixed blocklength. We calculate the optimal end-to-end rate, maximized over all possible processings at the relays, and show that it coincides with the end-to-end zero-error capacity. The optimal processing is shown to be identical at each relay and to correspond to a zero-error code. We also show that the rate of convergence to the asymptotic value is exponential in the length of the cascade.},\\n type={4},\\n author = {Niesen, U. and Fragouli, C. and Tuninetti, D.},\\n journal = {Allerton},\\n tags = {network_coding},\\n title = {On cascaded channels with finite complexity processing at intermediate nodes},\\n year = {2005}\\n}\\n\\n\",\"author_short\":[\"Niesen, U.\",\"Fragouli, C.\",\"Tuninetti, D.\"],\"key\":\"niesen_cascaded_2005\",\"id\":\"niesen_cascaded_2005\",\"bibbaseid\":\"niesen-fragouli-tuninetti-oncascadedchannelswithfinitecomplexityprocessingatintermediatenodes-2005\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"We consider communication through a cascade of $L$ identical Discrete Memory less Channels (DMCs).The source and destination node are allowed to use coding schemes of arbitrary complexity, but the intermediate relay nodes are restricted to process only blocks of $N$ symbols.It is well known that for any $L$ and $N{\\\\}toınfty$ the relays can use a capacity achieving code and communicate reliably as long as the rate of this code is below the capacity of the underlying DMC. The capacity of the cascade is hence equal to the network \\\\em min-cut capacity.For finite $N$ and $L{\\\\}toınfty$, we showed in previous work that the optimal intermediate processing is the highest rate zero-error code of length $N$ for the underlying DMC.The capacity of the cascade coincides with the rate of this zero-error code, and is always below the \\\\em zero-error capacity.In this work, we characterize how $N$ must scale with $L$ in order to achieve rates in between the zero-error and the min-cut capacity.In particular, we have observed that $N = {\\\\}Theta({\\\\}log L)$ is \\\\em sufficient to achieve any rate below the min-cut capacity. Here, we develop a novel upper bound on the capacity of cascades with optimal intermediate processing that applies for any $(N,L)$ pairs and use it to show that $N = {\\\\}Theta({\\\\}log L)$ is \\\\em necessary to achieve certain rates above the zero-error capacity. Furthermore, we propose a method to evaluate our upper bound by establishing a connection with the Set-Cover Problem in algorithms.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Niesen\"],\"firstnames\":[\"U.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tuninetti\"],\"firstnames\":[\"D.\"],\"suffixes\":[]}],\"journal\":\"ISIT\",\"tags\":\"network_coding\",\"title\":\"Scaling laws for line networks: from zero-error to min-cut capacity\",\"year\":\"2006\",\"bibtex\":\"@article{niesen_scaling_2006,\\n abstract = {We consider communication through a cascade of \\\\$L\\\\$ identical Discrete Memory less Channels (DMCs).The source and destination node are allowed to use coding schemes of arbitrary complexity, but the intermediate relay nodes are restricted to process only blocks of \\\\$N\\\\$ symbols.It is well known that for any \\\\$L\\\\$ and \\\\$N{\\\\textbackslash}toınfty\\\\$ the relays can use a capacity achieving code and communicate reliably as long as the rate of this code is below the capacity of the underlying DMC. The capacity of the cascade is hence equal to the network {\\\\textbackslash}em min-cut capacity.For finite \\\\$N\\\\$ and \\\\$L{\\\\textbackslash}toınfty\\\\$, we showed in previous work that the optimal intermediate processing is the highest rate zero-error code of length \\\\$N\\\\$ for the underlying DMC.The capacity of the cascade coincides with the rate of this zero-error code, and is always below the {\\\\textbackslash}em zero-error capacity.In this work, we characterize how \\\\$N\\\\$ must scale with \\\\$L\\\\$ in order to achieve rates in between the zero-error and the min-cut capacity.In particular, we have observed that \\\\$N = {\\\\textbackslash}Theta({\\\\textbackslash}log L)\\\\$ is {\\\\textbackslash}em sufficient to achieve any rate below the min-cut capacity. Here, we develop a novel upper bound on the capacity of cascades with optimal intermediate processing that applies for any \\\\$(N,L)\\\\$ pairs and use it to show that \\\\$N = {\\\\textbackslash}Theta({\\\\textbackslash}log L)\\\\$ is {\\\\textbackslash}em necessary to achieve certain rates above the zero-error capacity. Furthermore, we propose a method to evaluate our upper bound by establishing a connection with the Set-Cover Problem in algorithms.},\\n type={4},\\n author = {Niesen, U. and Fragouli, C. and Tuninetti, D.},\\n journal = {ISIT},\\n tags = {network_coding},\\n title = {Scaling laws for line networks: from zero-error to min-cut capacity},\\n year = {2006}\\n}\\n\\n\",\"author_short\":[\"Niesen, U.\",\"Fragouli, C.\",\"Tuninetti, D.\"],\"key\":\"niesen_scaling_2006\",\"id\":\"niesen_scaling_2006\",\"bibbaseid\":\"niesen-fragouli-tuninetti-scalinglawsforlinenetworksfromzeroerrortomincutcapacity-2006\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Onaran\"],\"firstnames\":[\"Efe\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Gatzianas\"],\"firstnames\":[\"Marios\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Symposium on Network Coding (NetCod)\",\"month\":\"June\",\"tags\":\"wireless\",\"title\":\"Broadcast erasure channel with feedback: the two multicast case - algorithms and bounds\",\"year\":\"2013\",\"bibtex\":\"@inproceedings{onaran_broadcast_2013,\\n type={4},\\n author = {Onaran, Efe and Gatzianas, Marios and Fragouli, C.},\\n booktitle = {{IEEE} {Symposium} on {Network} {Coding} ({NetCod})},\\n month = {June},\\n tags = {wireless},\\n title = {Broadcast erasure channel with feedback: the two multicast case - algorithms and bounds},\\n year = {2013}\\n}\\n\\n\",\"author_short\":[\"Onaran, E.\",\"Gatzianas, M.\",\"Fragouli, C.\"],\"key\":\"onaran_broadcast_2013\",\"id\":\"onaran_broadcast_2013\",\"bibbaseid\":\"onaran-gatzianas-fragouli-broadcasterasurechannelwithfeedbackthetwomulticastcasealgorithmsandbounds-2013\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"We consider a simple network, where a source and destination node are connected with a line of erasure channels. It is well known that in order to achieve the min-cut capacity, the intermediate nodes are required to process the information. We propose coding schemes for this setting, and discuss each scheme in terms of complexity, delay, achievable rate, memory requirement, and adaptability to unknown channel parameters. We also briefly discuss how these schemes can be extended to more general networks.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Pakzad\"],\"firstnames\":[\"P.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Shokrollahi\"],\"firstnames\":[\"A.\"],\"suffixes\":[]}],\"journal\":\"ISIT\",\"tags\":\"network_coding\",\"title\":\"Coding schemes for line networks\",\"year\":\"2005\",\"bibtex\":\"@article{pakzad_coding_2005,\\n abstract = {We consider a simple network, where a source and destination node are connected with a line of erasure channels. It is well known that in order to achieve the min-cut capacity, the intermediate nodes are required to process the information. We propose coding schemes for this setting, and discuss each scheme in terms of complexity, delay, achievable rate, memory requirement, and adaptability to unknown channel parameters. We also briefly discuss how these schemes can be extended to more general networks.},\\n type={4},\\n author = {Pakzad, P. and Fragouli, C. and Shokrollahi, A.},\\n journal = {ISIT},\\n tags = {network_coding},\\n title = {Coding schemes for line networks},\\n year = {2005}\\n}\\n\\n\",\"author_short\":[\"Pakzad, P.\",\"Fragouli, C.\",\"Shokrollahi, A.\"],\"key\":\"pakzad_coding_2005\",\"id\":\"pakzad_coding_2005\",\"bibbaseid\":\"pakzad-fragouli-shokrollahi-codingschemesforlinenetworks-2005\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Papadopoulos\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Global Conference on Signal and Information Processing (GlobalSIP)\",\"month\":\"December\",\"tags\":\"security\",\"title\":\"Achievable secrecy in arbitrary erasure networks with feedback\",\"year\":\"2014\",\"bibtex\":\"@inproceedings{papadopoulos_achievable_2014,\\n type={4},\\n author = {Papadopoulos, A. and Czap, L. and Fragouli, C.},\\n booktitle = {{IEEE} {Global} {Conference} on {Signal} and {Information} {Processing} ({GlobalSIP})},\\n month = {December},\\n tags = {security},\\n title = {Achievable secrecy in arbitrary erasure networks with feedback},\\n year = {2014}\\n}\\n\\n\",\"author_short\":[\"Papadopoulos, A.\",\"Czap, L.\",\"Fragouli, C.\"],\"key\":\"papadopoulos_achievable_2014\",\"id\":\"papadopoulos_achievable_2014\",\"bibbaseid\":\"papadopoulos-czap-fragouli-achievablesecrecyinarbitraryerasurenetworkswithfeedback-2014\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Papadopoulos\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Infromation Theory (ISIT)\",\"tags\":\"security\",\"title\":\"LP formulations for secrecy over erasure networks with feedback\",\"year\":\"2015\",\"bibtex\":\"@inproceedings{papadopoulos_lp_2015,\\n type={4},\\n author = {Papadopoulos, A. and Czap, L. and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} on {Infromation} {Theory} ({ISIT})},\\n tags = {security},\\n title = {{LP} formulations for secrecy over erasure networks with feedback},\\n year = {2015}\\n}\\n\\n\",\"author_short\":[\"Papadopoulos, A.\",\"Czap, L.\",\"Fragouli, C.\"],\"key\":\"papadopoulos_lp_2015\",\"id\":\"papadopoulos_lp_2015\",\"bibbaseid\":\"papadopoulos-czap-fragouli-lpformulationsforsecrecyovererasurenetworkswithfeedback-2015\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Papadopoulos\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"Annual Allerton Conference on Communication, Control and Computing (Allerton)\",\"month\":\"September\",\"tags\":\"security\",\"title\":\"Secret message capacity of a line network\",\"year\":\"2014\",\"bibtex\":\"@inproceedings{papadopoulos_secret_2014,\\n type={4},\\n author = {Papadopoulos, A. and Czap, L. and Fragouli, C.},\\n booktitle = {Annual {Allerton} {Conference} on {Communication}, {Control} and {Computing} ({Allerton})},\\n month = {September},\\n tags = {security},\\n title = {Secret message capacity of a line network},\\n year = {2014}\\n}\\n\\n\",\"author_short\":[\"Papadopoulos, A.\",\"Czap, L.\",\"Fragouli, C.\"],\"key\":\"papadopoulos_secret_2014\",\"id\":\"papadopoulos_secret_2014\",\"bibbaseid\":\"papadopoulos-czap-fragouli-secretmessagecapacityofalinenetwork-2014\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"We consider the two message set problem, where a source broadcasts a common message W1 to an arbitrary set of receivers U and a private message W2 to a subset of the receivers P x U. Transmissions occur over linear deterministic channels. For the case where at most two receivers do not require the private message, we give an exact characterization of the capacity region, where achievability is through linear coding.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Saeedi\"],\"firstnames\":[\"Shirin\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Prabhakaran\"],\"firstnames\":[\"V.\",\"M.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Information Theory Workshop (ITW)\",\"tags\":\"network_coding,wireless\",\"title\":\"On Degraded Two Message Set Broadcast\",\"year\":\"2009\",\"bibtex\":\"@inproceedings{saeedi_degraded_2009,\\n abstract = {We consider the two message set problem, where a source broadcasts a common message W1 to an arbitrary set of receivers U and a private message W2 to a subset of the receivers P x U. Transmissions occur over linear deterministic channels. For the case where at most two receivers do not require the private message, we give an exact characterization of the capacity region, where achievability is through linear coding.},\\n type={4},\\n author = {Saeedi, Shirin and Diggavi, Suhas N. and Fragouli, C. and Prabhakaran, V. M.},\\n booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},\\n tags = {network_coding,wireless},\\n title = {On {Degraded} {Two} {Message} {Set} {Broadcast}},\\n year = {2009}\\n}\\n\\n\",\"author_short\":[\"Saeedi, S.\",\"Diggavi, S. N.\",\"Fragouli, C.\",\"Prabhakaran, V. M.\"],\"key\":\"saeedi_degraded_2009\",\"id\":\"saeedi_degraded_2009\",\"bibbaseid\":\"saeedi-diggavi-fragouli-prabhakaran-ondegradedtwomessagesetbroadcast-2009\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Saeedi\"],\"firstnames\":[\"Shirin\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"month\":\"August\",\"tags\":\"channel_coding,network_coding\",\"title\":\"Degraded two-message multicast over graphs\",\"year\":\"2011\",\"bibtex\":\"@inproceedings{saeedi_degraded_2011,\\n type={4},\\n author = {Saeedi, Shirin and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n month = {August},\\n tags = {channel_coding,network_coding},\\n title = {Degraded two-message multicast over graphs},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Saeedi, S.\",\"Fragouli, C.\"],\"key\":\"saeedi_degraded_2011-1\",\"id\":\"saeedi_degraded_2011-1\",\"bibbaseid\":\"saeedi-fragouli-degradedtwomessagemulticastovergraphs-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"address\":\"New York, NY, USA\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Safaka\"],\"firstnames\":[\"I.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Argyraki\"],\"firstnames\":[\"K.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the 11th ACM Workshop on Hot Topics in Networks\",\"doi\":\"10.1145/2390231.2390244\",\"isbn\":\"978-1-4503-1776-4\",\"keywords\":\"information-theoretic security, group secrets\",\"note\":\"event-place: Redmond, Washington\",\"pages\":\"73–78\",\"publisher\":\"ACM\",\"series\":\"HotNets-XI\",\"tags\":\"security\",\"title\":\"Creating shared secrets out of thin air\",\"year\":\"2012\",\"bibtex\":\"@inproceedings{safaka_creating_2012,\\n address = {New York, NY, USA},\\n type={4},\\n author = {Safaka, I. and Fragouli, C. and Argyraki, K. and Diggavi, Suhas},\\n booktitle = {Proceedings of the 11th {ACM} {Workshop} on {Hot} {Topics} in {Networks}},\\n doi = {10.1145/2390231.2390244},\\n isbn = {978-1-4503-1776-4},\\n keywords = {information-theoretic security, group secrets},\\n note = {event-place: Redmond, Washington},\\n pages = {73--78},\\n publisher = {ACM},\\n series = {{HotNets}-{XI}},\\n tags = {security},\\n title = {Creating shared secrets out of thin air},\\n year = {2012}\\n}\\n\\n\",\"author_short\":[\"Safaka, I.\",\"Fragouli, C.\",\"Argyraki, K.\",\"Diggavi, S.\"],\"key\":\"safaka_creating_2012\",\"id\":\"safaka_creating_2012\",\"bibbaseid\":\"safaka-fragouli-argyraki-diggavi-creatingsharedsecretsoutofthinair-2012\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"information-theoretic security\",\"group secrets\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Safaka\"],\"firstnames\":[\"I.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Argyraki\"],\"firstnames\":[\"K.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Forensics &amp; Security\",\"tags\":\"security\",\"title\":\"Creating secrets out of packet erasures\",\"year\":\"2016\",\"bibtex\":\"@article{safaka_creating_2016,\\n type={2},\\n author = {Safaka, I. and Czap, L. and Fragouli, C. and Argyraki, K.},\\n journal = {IEEE Transactions on Information Forensics \\\\&amp; Security},\\n tags = {security},\\n title = {Creating secrets out of packet erasures},\\n year = {2016}\\n}\\n\\n\",\"author_short\":[\"Safaka, I.\",\"Czap, L.\",\"Fragouli, C.\",\"Argyraki, K.\"],\"key\":\"safaka_creating_2016\",\"id\":\"safaka_creating_2016\",\"bibbaseid\":\"safaka-czap-fragouli-argyraki-creatingsecretsoutofpacketerasures-2016\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"We consider the problem where a group of wireless nodes, connected to the same broadcast domain, want to create pairwise secrets, in the presence of an adversary Eve, who tries to listen in and steal these secrets. Existing solutions assume that Eve cannot perform certain computations (e.g., large-integer factorization) in useful time. We ask the question: can we solve this problem without assuming anything about Eve's computational capabilities? We propose a simple secret-agreement protocol, where the wireless nodes keep exchanging bits until they have agreed on pairwise secrets that Eve cannot reconstruct with very high probability. Our protocol relies on Eve's limited network presence (the fact that she cannot be located at an arbitrary number of points in the network at the same time), but assumes nothing about her computational capabilities. We formally show that, under standard theoretical assumptions, our protocol is information-theoretically secure (it leaks zero information to Eve about the secrets). Using a small wireless testbed of smartphones, we provide experimental evidence that it is feasible for 5 nodes to create thousands of secret bits per second, with their secrecy being independent from the adversary's capabilities.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Safaka\"],\"firstnames\":[\"I.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Argyraki\"],\"firstnames\":[\"K.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the 32nd Annual IEEE International Conference on Computer Communications (INFOCOM)\",\"keywords\":\"information-theoretic security, Pairwise secrets\",\"note\":\"event-place: Turin, Italy\",\"tags\":\"security\",\"title\":\"Exchanging Pairwise Secrets Efficiently\",\"year\":\"2013\",\"bibtex\":\"@inproceedings{safaka_exchanging_2013,\\n abstract = {We consider the problem where a group of wireless nodes, connected to the same broadcast domain, want to create pairwise secrets, in the presence of an adversary Eve, who tries to listen in and steal these secrets. Existing solutions assume that Eve cannot perform certain computations (e.g., large-integer factorization) in useful time. We ask the question: can we solve this problem without assuming anything about Eve's computational capabilities? We propose a simple secret-agreement protocol, where the wireless nodes keep exchanging bits until they have agreed on pairwise secrets that Eve cannot reconstruct with very high probability. Our protocol relies on Eve's limited network presence (the fact that she cannot be located at an arbitrary number of points in the network at the same time), but assumes nothing about her computational capabilities. We formally show that, under standard theoretical assumptions, our protocol is information-theoretically secure (it leaks zero information to Eve about the secrets). Using a small wireless testbed of smartphones, we provide experimental evidence that it is feasible for 5 nodes to create thousands of secret bits per second, with their secrecy being independent from the adversary's capabilities.},\\n type={4},\\n author = {Safaka, I. and Fragouli, C. and Argyraki, K. and Diggavi, Suhas},\\n booktitle = {Proceedings of the 32nd {Annual} {IEEE} {International} {Conference} on {Computer} {Communications} ({INFOCOM})},\\n keywords = {information-theoretic security, Pairwise secrets},\\n note = {event-place: Turin, Italy},\\n tags = {security},\\n title = {Exchanging {Pairwise} {Secrets} {Efficiently}},\\n year = {2013}\\n}\\n\\n\",\"author_short\":[\"Safaka, I.\",\"Fragouli, C.\",\"Argyraki, K.\",\"Diggavi, S.\"],\"key\":\"safaka_exchanging_2013\",\"id\":\"safaka_exchanging_2013\",\"bibbaseid\":\"safaka-fragouli-argyraki-diggavi-exchangingpairwisesecretsefficiently-2013\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"information-theoretic security\",\"Pairwise secrets\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Safaka\"],\"firstnames\":[\"I.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Czap\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Argyraki\"],\"firstnames\":[\"K.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Symposium on Network Coding (NetCod)\",\"month\":\"July\",\"tags\":\"security\",\"title\":\"Towards unconditional tor-like anonymity\",\"year\":\"2015\",\"bibtex\":\"@inproceedings{safaka_towards_2015,\\n type={4},\\n author = {Safaka, I. and Czap, L. and Argyraki, K. and Fragouli, C.},\\n booktitle = {{IEEE} {Symposium} on {Network} {Coding} ({NetCod})},\\n month = {July},\\n tags = {security},\\n title = {Towards unconditional tor-like anonymity},\\n year = {2015}\\n}\\n\\n\",\"author_short\":[\"Safaka, I.\",\"Czap, L.\",\"Argyraki, K.\",\"Fragouli, C.\"],\"key\":\"safaka_towards_2015\",\"id\":\"safaka_towards_2015\",\"bibbaseid\":\"safaka-czap-argyraki-fragouli-towardsunconditionaltorlikeanonymity-2015\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Sattari\"],\"firstnames\":[\"P.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Markopoulou\"],\"firstnames\":[\"A.\"],\"suffixes\":[]}],\"journal\":\"Physical Communication\",\"note\":\"Publisher: Elsevier\",\"tags\":\"network_coding\",\"title\":\"Active topology inference using network coding\",\"year\":\"2012\",\"bibtex\":\"@article{sattari_active_2012,\\n type={4},\\n author = {Sattari, P. and Fragouli, C. and Markopoulou, A.},\\n journal = {Physical Communication},\\n note = {Publisher: Elsevier},\\n tags = {network_coding},\\n title = {Active topology inference using network coding},\\n year = {2012}\\n}\\n\\n\",\"author_short\":[\"Sattari, P.\",\"Fragouli, C.\",\"Markopoulou, A.\"],\"key\":\"sattari_active_2012\",\"id\":\"sattari_active_2012\",\"bibbaseid\":\"sattari-fragouli-markopoulou-activetopologyinferenceusingnetworkcoding-2012\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"The network coding paradigm is based on the idea that independent information flows can be linearly combined throughout the network to give benefits in terms of throughput, complexity, etc. In this paper, we explore the application of the network coding paradigm to topology inference. Our goal is to infer the topology of a network by sending probes between a given set of multiple sources and multiple receivers and by having intermediate nodes perform network coding operations. Our main idea behind using network coding is to introduce topologydependent correlation, which can be exploited at the receivers to infer the topology. We explored this idea in [33] for trees. We also combined network coding and tomographic techniques to infer the topology of a Directed Acyclic Graph (DAG), under specific routing assumptions, in [34]. The supporting idea in [34] was to decompose a traditional (i.e., without network coding) multiple source, multiple receiver tomography problem into multiple two source, two receiver subproblems, as shown in [12]. In this paper, we unify and extend our two previous pieces of work. Our main contribution is that when intermediate nodes perform network coding, topological information contained in network coded packets allows to uniquely identify a tree topology, or to accurately distinguish among all different 2-by-2 subnetwork components in a general DAG; this knowledge can then be used to merge the subnetworks and reconstruct the general topology. Our approach is applicable to any general Internet-like topology, and is robust to the presence of delay variability and packet loss.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Sattari\"],\"firstnames\":[\"P.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Markopoulou\"],\"firstnames\":[\"Athina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"N/A\",\"tags\":\"network_coding\",\"title\":\"Inferring Logical Topologies using Network Coding\",\"year\":\"2010\",\"bibtex\":\"@article{sattari_inferring_2010,\\n abstract = {The network coding paradigm is based on the idea that independent information flows can be linearly combined throughout the network to give benefits in terms of throughput, complexity, etc. In this paper, we explore the application of the network coding paradigm to topology inference. Our goal is to infer the topology of a network by sending probes between a given set of multiple sources and multiple receivers and by having intermediate nodes perform network coding operations. Our main idea behind using network coding is to introduce topologydependent correlation, which can be exploited at the receivers to infer the topology. We explored this idea in [33] for trees. We also combined network coding and tomographic techniques to infer the topology of a Directed Acyclic Graph (DAG), under specific routing assumptions, in [34]. The supporting idea in [34] was to decompose a traditional (i.e., without network coding) multiple source, multiple receiver tomography problem into multiple two source, two receiver subproblems, as shown in [12]. In this paper, we unify and extend our two previous pieces of work. Our main contribution is that when intermediate nodes perform network coding, topological information contained in network coded packets allows to uniquely identify a tree topology, or to accurately distinguish among all different 2-by-2 subnetwork components in a general DAG; this knowledge can then be used to merge the subnetworks and reconstruct the general topology. Our approach is applicable to any general Internet-like topology, and is robust to the presence of delay variability and packet loss.},\\n type={4},\\n author = {Sattari, P. and Markopoulou, Athina and Fragouli, C.},\\n journal = {N/A},\\n tags = {network_coding},\\n title = {Inferring {Logical} {Topologies} using {Network} {Coding}},\\n year = {2010}\\n}\\n\\n\",\"author_short\":[\"Sattari, P.\",\"Markopoulou, A.\",\"Fragouli, C.\"],\"key\":\"sattari_inferring_2010\",\"id\":\"sattari_inferring_2010\",\"bibbaseid\":\"sattari-markopoulou-fragouli-inferringlogicaltopologiesusingnetworkcoding-2010\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Sattari\"],\"firstnames\":[\"P.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Markopoulou\"],\"firstnames\":[\"Athina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Network Coding (NetCod)\",\"tags\":\"network_coding\",\"title\":\"Maximum likelihood estimation for multiple-source loss tomography with network coding\",\"year\":\"2011\",\"bibtex\":\"@inproceedings{sattari_maximum_2011,\\n type={4},\\n author = {Sattari, P. and Markopoulou, Athina and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} on {Network} {Coding} ({NetCod})},\\n tags = {network_coding},\\n title = {Maximum likelihood estimation for multiple-source loss tomography with network coding},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Sattari, P.\",\"Markopoulou, A.\",\"Fragouli, C.\"],\"key\":\"sattari_maximum_2011\",\"id\":\"sattari_maximum_2011\",\"bibbaseid\":\"sattari-markopoulou-fragouli-maximumlikelihoodestimationformultiplesourcelosstomographywithnetworkcoding-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"In this paper, we combine network coding and tomographic techniques for topology inference. Our goal is to infer the topology of a network by sending probes between a given set of multiple sources and multiple receivers and by having intermediate nodes perform network coding operations. We combine and extend two ideas that have been developed independently. On one hand, network coding introduces topology-dependent correlation, which can then be exploited at the receivers to infer the topology. On the other hand, it has been shown that a traditional (i.e., without network coding) multiple source, multiple receiver tomography problem can be decomposed into multiple two source, two receiver subproblems. Our first contribution is to show that, when intermediate nodes perform network coding, topological information contained in network coded packets allows to accurately distinguish among all different 2-by-2 subnetwork components, which was not possible with traditional tomographic techniques. Our second contribution is to use this knowledge to merge the subnetworks and accurately reconstruct the general topology. Our approach is applicable to any general Internet-like topology, and is robust to the presence of delay variability and packet loss.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Sattari\"],\"firstnames\":[\"P.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Markopoulou\"],\"firstnames\":[\"Athina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"Network Coding, Theory, and Applications, 2009. NetCod '09. Workshop on\",\"doi\":\"10.1109/netcod.2009.5191391\",\"keywords\":\"network coding, encoding, multiple source multiple destination topology inference, network coded packets, network topology, receivers, routing protocols, telecommunication network topologycorrelation, tomographic techniques\",\"month\":\"June\",\"pages\":\"36–41\",\"tags\":\"network_coding\",\"title\":\"Multiple source multiple destination topology inference using network coding\",\"year\":\"2009\",\"bibtex\":\"@inproceedings{sattari_multiple_2009,\\n abstract = {In this paper, we combine network coding and tomographic techniques for topology inference. Our goal is to infer the topology of a network by sending probes between a given set of multiple sources and multiple receivers and by having intermediate nodes perform network coding operations. We combine and extend two ideas that have been developed independently. On one hand, network coding introduces topology-dependent correlation, which can then be exploited at the receivers to infer the topology. On the other hand, it has been shown that a traditional (i.e., without network coding) multiple source, multiple receiver tomography problem can be decomposed into multiple two source, two receiver subproblems. Our first contribution is to show that, when intermediate nodes perform network coding, topological information contained in network coded packets allows to accurately distinguish among all different 2-by-2 subnetwork components, which was not possible with traditional tomographic techniques. Our second contribution is to use this knowledge to merge the subnetworks and accurately reconstruct the general topology. Our approach is applicable to any general Internet-like topology, and is robust to the presence of delay variability and packet loss.},\\n type={4},\\n author = {Sattari, P. and Markopoulou, Athina and Fragouli, C.},\\n booktitle = {Network {Coding}, {Theory}, and {Applications}, 2009. {NetCod} '09. {Workshop} on},\\n doi = {10.1109/netcod.2009.5191391},\\n keywords = {network coding, encoding, multiple source multiple destination topology inference, network coded packets, network topology, receivers, routing protocols, telecommunication network topologycorrelation, tomographic techniques},\\n month = {June},\\n pages = {36--41},\\n tags = {network_coding},\\n title = {Multiple source multiple destination topology inference using network coding},\\n year = {2009}\\n}\\n\\n\",\"author_short\":[\"Sattari, P.\",\"Markopoulou, A.\",\"Fragouli, C.\"],\"key\":\"sattari_multiple_2009\",\"id\":\"sattari_multiple_2009\",\"bibbaseid\":\"sattari-markopoulou-fragouli-multiplesourcemultipledestinationtopologyinferenceusingnetworkcoding-2009\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"network coding\",\"encoding\",\"multiple source multiple destination topology inference\",\"network coded packets\",\"network topology\",\"receivers\",\"routing protocols\",\"telecommunication network topologycorrelation\",\"tomographic techniques\"],\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"Video applications are increasingly popular over smartphones. However, in current cellular systems, the downlink data rate fluctuates and the loss rate can be quite high. We are interested in the scenario where a group of smartphone users, within proximity of each other, are interested in viewing the same video at the same time and are also willing to cooperate with each other. We propose a system that maximizes the video quality by appropriately using all available resources, namely the cellular connections to the phones as well as the device-to-device links that can be established via Bluetooth or WiFi. Key ingredients of our design are: (i) the cooperation among users, (ii) network coding, and (iii) exploiting broadcast in the mobile-to-mobile links. Our approach is grounded on a network utility maximization formulation of the problem. We present numerical results that demonstrate the benefit of our approach, and we implement a prototype on android phones.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Seferoglu\"],\"firstnames\":[\"H.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Keller\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Markopoulou\"],\"firstnames\":[\"Athina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Allerton Conference on Communications, Control and Computing\",\"tags\":\"wireless,network_coding\",\"title\":\"SmartCast: Cooperative video streaming on smartphones\",\"year\":\"2011\",\"bibtex\":\"@inproceedings{seferoglu_smartcast_2011,\\n abstract = {Video applications are increasingly popular over smartphones. However, in current cellular systems, the downlink data rate fluctuates and the loss rate can be quite high. We are interested in the scenario where a group of smartphone users, within proximity of each other, are interested in viewing the same video at the same time and are also willing to cooperate with each other. We propose a system that maximizes the video quality by appropriately using all available resources, namely the cellular connections to the phones as well as the device-to-device links that can be established via Bluetooth or WiFi. Key ingredients of our design are: (i) the cooperation among users, (ii) network coding, and (iii) exploiting broadcast in the mobile-to-mobile links. Our approach is grounded on a network utility maximization formulation of the problem. We present numerical results that demonstrate the benefit of our approach, and we implement a prototype on android phones.},\\n type={4},\\n author = {Seferoglu, H. and Keller, L. and Markopoulou, Athina and Fragouli, C.},\\n booktitle = {{IEEE} {Allerton} {Conference} on {Communications}, {Control} and {Computing}},\\n tags = {wireless,network_coding},\\n title = {{SmartCast}: {Cooperative} video streaming on smartphones},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Seferoglu, H.\",\"Keller, L.\",\"Markopoulou, A.\",\"Fragouli, C.\"],\"key\":\"seferoglu_smartcast_2011-1\",\"id\":\"seferoglu_smartcast_2011-1\",\"bibbaseid\":\"seferoglu-keller-markopoulou-fragouli-smartcastcooperativevideostreamingonsmartphones-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Sengupta\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wang\"],\"firstnames\":[\"I.\",\"-Hsiang\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Wireless Communications\",\"tags\":\"wireless\",\"title\":\"Cooperative relaying at finite SNR–role of Quantize-Map-and-Forward\",\"year\":\"2014\",\"bibtex\":\"@article{sengupta_cooperative_2014,\\n type={2},\\n author = {Sengupta, A. and Wang, I. -Hsiang and Fragouli, C.},\\n journal = {IEEE Transactions on Wireless Communications},\\n tags = {wireless},\\n title = {Cooperative relaying at finite {SNR}–role of {Quantize}-{Map}-and-{Forward}},\\n year = {2014}\\n}\\n\\n\",\"author_short\":[\"Sengupta, A.\",\"Wang, I. -.\",\"Fragouli, C.\"],\"key\":\"sengupta_cooperative_2014\",\"id\":\"sengupta_cooperative_2014\",\"bibbaseid\":\"sengupta-wang-fragouli-cooperativerelayingatfinitesnrroleofquantizemapandforward-2014\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Sengupta\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Brahma\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"tags\":\"wireless\",\"title\":\"Efficient subnetwork selection in relay networks\",\"year\":\"2014\",\"bibtex\":\"@inproceedings{sengupta_efficient_2014,\\n type={4},\\n author = {Sengupta, A. and Brahma, S. and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n tags = {wireless},\\n title = {Efficient subnetwork selection in relay networks},\\n year = {2014}\\n}\\n\\n\",\"author_short\":[\"Sengupta, A.\",\"Brahma, S.\",\"Fragouli, C.\"],\"key\":\"sengupta_efficient_2014\",\"id\":\"sengupta_efficient_2014\",\"bibbaseid\":\"sengupta-brahma-fragouli-efficientsubnetworkselectioninrelaynetworks-2014\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Sengupta\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Brahma\"],\"firstnames\":[\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ozgur\"],\"firstnames\":[\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]}],\"booktitle\":\"Information Theory Workshop (ITW), 2011 IEEE\",\"pages\":\"140–144\",\"publisher\":\"IEEE\",\"tags\":\"wireless\",\"title\":\"Graph-based codes for Quantize-Map-and-Forward relaying\",\"year\":\"2011\",\"bibtex\":\"@inproceedings{sengupta_graph-based_2011,\\n type={4},\\n author = {Sengupta, A. and Brahma, S. and Ozgur, A. and Fragouli, C. and Diggavi, S.},\\n booktitle = {Information {Theory} {Workshop} ({ITW}), 2011 {IEEE}},\\n pages = {140--144},\\n publisher = {IEEE},\\n tags = {wireless},\\n title = {Graph-based codes for {Quantize}-{Map}-and-{Forward} relaying},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Sengupta, A.\",\"Brahma, S.\",\"Ozgur, A.\",\"Fragouli, C.\",\"Diggavi, S.\"],\"key\":\"sengupta_graph-based_2011\",\"id\":\"sengupta_graph-based_2011\",\"bibbaseid\":\"sengupta-brahma-ozgur-fragouli-diggavi-graphbasedcodesforquantizemapandforwardrelaying-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"Quantize-Map-and-Forward (QMF) relaying has been shown to achieve the optimal diversity-multiplexing trade-off (DMT) for the slow fading single-antenna relay channel, regardless of whether the relay is full-duplex or half-duplex. A key reason for the DMT optimality is that quantizing at the noise level suffices to achieve the cut-set bound approximately and hence the relay does not need any instantaneous channel state information (CSI). However, DMT only captures the high SNR performance and potentially, limited CSI at the relay can help improve the performance in moderate SNR regimes. In this work we propose an optimization framework for QMF relaying in slow fading relay channels. Focusing on vector Gaussian quantizers, for the full-duplex relay we optimize the outage probability by finding the best quantization level according to the available CSI at the relay and the channel statistics. For the half-duplex relay we find good relay schedules using the same framework. Numerical evaluations show the improvement of taking the CSI into account over noise-level quantization and static schedules in moderate SNR regimes.\",\"address\":\"New York\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Sengupta\"],\"firstnames\":[\"Ayan\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wang\"],\"firstnames\":[\"I.\",\"-Hsiang\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"2012 50Th Annual Allerton Conference On Communication, Control, And Computing (Allerton)\",\"isbn\":\"978-1-4673-4539-2\",\"pages\":\"1928–1934\",\"publisher\":\"Ieee\",\"tags\":\"wireless\",\"title\":\"Optimizing Quantize-Map-and-Forward in Slow Fading Relay Networks\",\"year\":\"2012\",\"bibtex\":\"@inproceedings{sengupta_optimizing_2012,\\n abstract = {Quantize-Map-and-Forward (QMF) relaying has been shown to achieve the optimal diversity-multiplexing trade-off (DMT) for the slow fading single-antenna relay channel, regardless of whether the relay is full-duplex or half-duplex. A key reason for the DMT optimality is that quantizing at the noise level suffices to achieve the cut-set bound approximately and hence the relay does not need any instantaneous channel state information (CSI). However, DMT only captures the high SNR performance and potentially, limited CSI at the relay can help improve the performance in moderate SNR regimes. In this work we propose an optimization framework for QMF relaying in slow fading relay channels. Focusing on vector Gaussian quantizers, for the full-duplex relay we optimize the outage probability by finding the best quantization level according to the available CSI at the relay and the channel statistics. For the half-duplex relay we find good relay schedules using the same framework. Numerical evaluations show the improvement of taking the CSI into account over noise-level quantization and static schedules in moderate SNR regimes.},\\n address = {New York},\\n type={4},\\n author = {Sengupta, Ayan and Wang, I. -Hsiang and Fragouli, C.},\\n booktitle = {2012 {50Th} {Annual} {Allerton} {Conference} {On} {Communication}, {Control}, {And} {Computing} ({Allerton})},\\n isbn = {978-1-4673-4539-2},\\n pages = {1928--1934},\\n publisher = {Ieee},\\n tags = {wireless},\\n title = {Optimizing {Quantize}-{Map}-and-{Forward} in {Slow} {Fading} {Relay} {Networks}},\\n year = {2012}\\n}\\n\\n\",\"author_short\":[\"Sengupta, A.\",\"Wang, I. -.\",\"Fragouli, C.\"],\"key\":\"sengupta_optimizing_2012\",\"id\":\"sengupta_optimizing_2012\",\"bibbaseid\":\"sengupta-wang-fragouli-optimizingquantizemapandforwardinslowfadingrelaynetworks-2012\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Siavoshani\"],\"firstnames\":[\"M.\",\"J.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"Network Coding (NetCod), 2012 International Symposium on\",\"pages\":\"85–90\",\"publisher\":\"IEEE\",\"tags\":\"network_coding,wireless\",\"title\":\"Multi-terminal secrecy in a linear non-coherent packetized networks\",\"year\":\"2012\",\"bibtex\":\"@inproceedings{siavoshani_multi-terminal_2012,\\n type={4},\\n author = {Siavoshani, M. J. and Fragouli, C.},\\n booktitle = {Network {Coding} ({NetCod}), 2012 {International} {Symposium} on},\\n pages = {85--90},\\n publisher = {IEEE},\\n tags = {network_coding,wireless},\\n title = {Multi-terminal secrecy in a linear non-coherent packetized networks},\\n year = {2012}\\n}\\n\\n\",\"author_short\":[\"Siavoshani, M. J.\",\"Fragouli, C.\"],\"key\":\"siavoshani_multi-terminal_2012\",\"id\":\"siavoshani_multi-terminal_2012\",\"bibbaseid\":\"siavoshani-fragouli-multiterminalsecrecyinalinearnoncoherentpacketizednetworks-2012\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Siavoshani\"],\"firstnames\":[\"M.\",\"J.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\",\"N.\"],\"suffixes\":[]}],\"journal\":\"Information Theory, IEEE Transactions on\",\"note\":\"Publisher: IEEE\",\"number\":\"5\",\"pages\":\"2599–2619\",\"tags\":\"network_coding\",\"title\":\"Subspace properties of network coding and their applications\",\"volume\":\"58\",\"year\":\"2012\",\"bibtex\":\"@article{siavoshani_subspace_2012,\\n type={2},\\n author = {Siavoshani, M. J. and Fragouli, C. and Diggavi, S. N.},\\n journal = {Information Theory, IEEE Transactions on},\\n note = {Publisher: IEEE},\\n number = {5},\\n pages = {2599--2619},\\n tags = {network_coding},\\n title = {Subspace properties of network coding and their applications},\\n volume = {58},\\n year = {2012}\\n}\\n\\n\",\"author_short\":[\"Siavoshani, M. J.\",\"Fragouli, C.\",\"Diggavi, S. N.\"],\"key\":\"siavoshani_subspace_2012\",\"id\":\"siavoshani_subspace_2012\",\"bibbaseid\":\"siavoshani-fragouli-diggavi-subspacepropertiesofnetworkcodingandtheirapplications-2012\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"A key problem in transporting multimedia traffic across wireless networks is a controlled sharing of the wireless link by different packet streams. So far this problem has been treated as that of providing support for quality of service in time division multiplexing based medium access control protocols (MAC). Adopting a different perspective to the problem, this paper describes an approach based on extending the class-based queueing (CBQ) based controlled hierarchical link sharing model proposed for the Internet. Our scheme enhances CBQ, which works well in wired links such as point-to-point wires of fixed bandwidth, to also work well with wireless links based on radio channels that are (i) inherently shared on-demand among multiple radios, and (ii) are subject to highly dynamic bandwidth variations due to spatially and temporally varying fading with accompanying burst errors. The proposed scheme is based on combining a modified version of CBQ with channel-state dependent packet scheduling.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Sivaraman\"],\"firstnames\":[\"V.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Srivastava\"],\"firstnames\":[\"M.\",\"B.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"doi\":\"10.1109/INFCOM.1998.665077\",\"journal\":\"Infocom\",\"pages\":\"pages 572–580\",\"tags\":\"wireless\",\"title\":\"Controlled multimedia wireless link sharing via enhanced class-based queuing with channel-state-dependent packet scheduling\",\"volume\":\"vol. 2\",\"year\":\"1998\",\"bibtex\":\"@article{sivaraman_controlled_1998,\\n abstract = {A key problem in transporting multimedia traffic across wireless networks is a controlled sharing of the wireless link by different packet streams. So far this problem has been treated as that of providing support for quality of service in time division multiplexing based medium access control protocols (MAC). Adopting a different perspective to the problem, this paper describes an approach based on extending the class-based queueing (CBQ) based controlled hierarchical link sharing model proposed for the Internet. Our scheme enhances CBQ, which works well in wired links such as point-to-point wires of fixed bandwidth, to also work well with wireless links based on radio channels that are (i) inherently shared on-demand among multiple radios, and (ii) are subject to highly dynamic bandwidth variations due to spatially and temporally varying fading with accompanying burst errors. The proposed scheme is based on combining a modified version of CBQ with channel-state dependent packet scheduling.},\\n type={4},\\n author = {Sivaraman, V. and Srivastava, M. B. and Fragouli, C.},\\n doi = {10.1109/INFCOM.1998.665077},\\n journal = {Infocom},\\n pages = {pages 572--580},\\n tags = {wireless},\\n title = {Controlled multimedia wireless link sharing via enhanced class-based queuing with channel-state-dependent packet scheduling},\\n volume = {vol. 2},\\n year = {1998}\\n}\\n\\n\",\"author_short\":[\"Sivaraman, V.\",\"Srivastava, M. B.\",\"Fragouli, C.\"],\"key\":\"sivaraman_controlled_1998\",\"id\":\"sivaraman_controlled_1998\",\"bibbaseid\":\"sivaraman-srivastava-fragouli-controlledmultimediawirelesslinksharingviaenhancedclassbasedqueuingwithchannelstatedependentpacketscheduling-1998\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Song\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Srinivasavaradhan\"],\"firstnames\":[\"SR\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Information Theory Workshop (ITW)\",\"tags\":\"network_coding\",\"title\":\"The Benefit of Being Flexible in Distributed Computation\",\"year\":\"2017\",\"bibtex\":\"@inproceedings{song_benefit_2017,\\n type={4},\\n author = {Song, L. and Srinivasavaradhan, SR and Fragouli, C.},\\n booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},\\n tags = {network_coding},\\n title = {The {Benefit} of {Being} {Flexible} in {Distributed} {Computation}},\\n year = {2017}\\n}\\n\\n\",\"author_short\":[\"Song, L.\",\"Srinivasavaradhan, S.\",\"Fragouli, C.\"],\"key\":\"song_benefit_2017\",\"id\":\"song_benefit_2017\",\"bibbaseid\":\"song-srinivasavaradhan-fragouli-thebenefitofbeingflexibleindistributedcomputation-2017\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Song\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Symposium on Network Coding (NetCod)\",\"month\":\"July\",\"tags\":\"network_coding\",\"title\":\"Content-type coding\",\"year\":\"2015\",\"bibtex\":\"@inproceedings{song_content-type_2015,\\n type={4},\\n author = {Song, L. and Fragouli, C.},\\n booktitle = {{IEEE} {Symposium} on {Network} {Coding} ({NetCod})},\\n month = {July},\\n tags = {network_coding},\\n title = {Content-type coding},\\n year = {2015}\\n}\\n\\n\",\"author_short\":[\"Song, L.\",\"Fragouli, C.\"],\"key\":\"song_content-type_2015\",\"id\":\"song_content-type_2015\",\"bibbaseid\":\"song-fragouli-contenttypecoding-2015\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Song\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"tags\":\"network_coding\",\"title\":\"A Deterministic Algorithm for Pliable Index Coding\",\"year\":\"2016\",\"bibtex\":\"@inproceedings{song_deterministic_2016,\\n type={4},\\n author = {Song, L. and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n tags = {network_coding},\\n title = {A {Deterministic} {Algorithm} for {Pliable} {Index} {Coding}},\\n year = {2016}\\n}\\n\\n\\n\",\"author_short\":[\"Song, L.\",\"Fragouli, C.\"],\"key\":\"song_deterministic_2016\",\"id\":\"song_deterministic_2016\",\"bibbaseid\":\"song-fragouli-adeterministicalgorithmforpliableindexcoding-2016\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Song\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"tags\":\"network_coding\",\"title\":\"Making recommendations bandwidth aware\",\"year\":\"2017\",\"bibtex\":\"@inproceedings{song_making_2017,\\n type={4},\\n author = {Song, L. and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n tags = {network_coding},\\n title = {Making recommendations bandwidth aware},\\n year = {2017}\\n}\\n\\n\",\"author_short\":[\"Song, L.\",\"Fragouli, C.\"],\"key\":\"song_making_2017\",\"id\":\"song_making_2017\",\"bibbaseid\":\"song-fragouli-makingrecommendationsbandwidthaware-2017\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Song\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Transactions on Information Theory\",\"tags\":\"network_coding\",\"title\":\"Making recommendations bandwidth aware\",\"year\":\"2018\",\"bibtex\":\"@inproceedings{song_making_2018,\\n type={2},\\n author = {Song, L. and Fragouli, C.},\\n booktitle = {{IEEE} {Transactions} on {Information} {Theory}},\\n tags = {network_coding},\\n title = {Making recommendations bandwidth aware},\\n year = {2018}\\n}\\n\\n\",\"author_short\":[\"Song, L.\",\"Fragouli, C.\"],\"key\":\"song_making_2018\",\"id\":\"song_making_2018\",\"bibbaseid\":\"song-fragouli-makingrecommendationsbandwidthaware-2018\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Song\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT)\",\"tags\":\"network_coding\",\"title\":\"A pliable index coding approach to data shuffling\",\"year\":\"2017\",\"bibtex\":\"@inproceedings{song_pliable_2017,\\n type={4},\\n author = {Song, L. and Fragouli, C.},\\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\\n tags = {network_coding},\\n title = {A pliable index coding approach to data shuffling},\\n year = {2017}\\n}\\n\\n\\n\\n\",\"author_short\":[\"Song, L.\",\"Fragouli, C.\"],\"key\":\"song_pliable_2017\",\"id\":\"song_pliable_2017\",\"bibbaseid\":\"song-fragouli-apliableindexcodingapproachtodatashuffling-2017\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"2\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Song\"],\"firstnames\":[\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Transactions on Information Theory\",\"tags\":\"network_coding\",\"title\":\"A polynomial-time algorithm for pliable index coding\",\"year\":\"2018\",\"bibtex\":\"@inproceedings{song_polynomial-time_2018,\\n type={2},\\n author = {Song, L. and Fragouli, C.},\\n booktitle = {{IEEE} {Transactions} on {Information} {Theory}},\\n tags = {network_coding},\\n title = {A polynomial-time algorithm for pliable index coding},\\n year = {2018}\\n}\\n\\n\\n\",\"author_short\":[\"Song, L.\",\"Fragouli, C.\"],\"key\":\"song_polynomial-time_2018\",\"id\":\"song_polynomial-time_2018\",\"bibbaseid\":\"song-fragouli-apolynomialtimealgorithmforpliableindexcoding-2018\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Srinivasavaradhan\"],\"firstnames\":[\"SR\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\",\"N.\"],\"suffixes\":[]}],\"journal\":\"IEEE Symposium on Information Theory\",\"tags\":\"channel_coding, bio\",\"title\":\"Equivalence of ML decoding to a continuous optimization problem\",\"year\":\"2020\",\"bibtex\":\"@article{srinivasavaradhan_equivalence_2020,\\n type={4},\\n author = {Srinivasavaradhan, SR and Fragouli, C. and Diggavi, S. N.},\\n journal = {IEEE Symposium on Information Theory},\\n tags = {channel_coding, bio},\\n title = {Equivalence of {ML} decoding to a continuous optimization problem},\\n year = {2020}\\n}\\n\\n\\n\",\"author_short\":[\"Srinivasavaradhan, S.\",\"Fragouli, C.\",\"Diggavi, S. N.\"],\"key\":\"srinivasavaradhan_equivalence_2020\",\"id\":\"srinivasavaradhan_equivalence_2020\",\"bibbaseid\":\"srinivasavaradhan-fragouli-diggavi-equivalenceofmldecodingtoacontinuousoptimizationproblem-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Srinivasavaradhan\"],\"firstnames\":[\"SR\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Du\"],\"firstnames\":[\"Michelle\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"IEEE International Symposium of Information Theory (ISIT)\",\"tags\":\"channel_coding, bio\",\"title\":\"Symbolwise MAP for Multiple Deletion Channels\",\"year\":\"2019\",\"bibtex\":\"@article{srinivasavaradhan_symbolwise_2019,\\n type={4},\\n author = {Srinivasavaradhan, SR and Du, Michelle and Diggavi, Suhas and Fragouli, C.},\\n journal = {IEEE International Symposium of Information Theory (ISIT)},\\n tags = {channel_coding, bio},\\n title = {Symbolwise {MAP} for {Multiple} {Deletion} {Channels}},\\n year = {2019}\\n}\\n\\n\",\"author_short\":[\"Srinivasavaradhan, S.\",\"Du, M.\",\"Diggavi, S.\",\"Fragouli, C.\"],\"key\":\"srinivasavaradhan_symbolwise_2019\",\"id\":\"srinivasavaradhan_symbolwise_2019\",\"bibbaseid\":\"srinivasavaradhan-du-diggavi-fragouli-symbolwisemapformultipledeletionchannels-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Tsai\"],\"firstnames\":[\"CY\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Agarwal\"],\"firstnames\":[\"G.\",\"K.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium of Information Theory (ISIT)\",\"month\":\"January\",\"tags\":\"security\",\"title\":\"A Distortion Based Approach for Protecting Inferences\",\"year\":\"2017\",\"bibtex\":\"@inproceedings{tsai_distortion_2017,\\n type={4},\\n author = {Tsai, CY and Agarwal, G. K. and Fragouli, C. and Diggavi, S.},\\n booktitle = {{IEEE} {International} {Symposium} of {Information} {Theory} ({ISIT})},\\n month = {January},\\n tags = {security},\\n title = {A {Distortion} {Based} {Approach} for {Protecting} {Inferences}},\\n year = {2017}\\n}\\n\\n\",\"author_short\":[\"Tsai, C.\",\"Agarwal, G. K.\",\"Fragouli, C.\",\"Diggavi, S.\"],\"key\":\"tsai_distortion_2017\",\"id\":\"tsai_distortion_2017\",\"bibbaseid\":\"tsai-agarwal-fragouli-diggavi-adistortionbasedapproachforprotectinginferences-2017\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"We consider a source that transmits to a receiver by routing the information packets over a communication network and examine rate benefits that finite complexity processing at the intermediate nodes may offer. We show that the processing capabilities of the intermediate nodes affect not only the end-to-end achievable rate, but also the optimal routing strategy. For example, there exist network configurations where the maximal throughput is achieved only by coding across independent information streams.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Tuninetti\"],\"firstnames\":[\"D.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"ISITA, Parma\",\"tags\":\"network_coding\",\"title\":\"Processing along the way: forwarding vs. coding\",\"year\":\"2004\",\"bibtex\":\"@article{tuninetti_processing_2004,\\n abstract = {We consider a source that transmits to a receiver by routing the information packets over a communication network and examine rate benefits that finite complexity processing at the intermediate nodes may offer. We show that the processing capabilities of the intermediate nodes affect not only the end-to-end achievable rate, but also the optimal routing strategy. For example, there exist network configurations where the maximal throughput is achieved only by coding across independent information streams.},\\n type={4},\\n author = {Tuninetti, D. and Fragouli, C.},\\n journal = {ISITA, Parma},\\n tags = {network_coding},\\n title = {Processing along the way: forwarding vs. coding},\\n year = {2004}\\n}\\n\\n\",\"author_short\":[\"Tuninetti, D.\",\"Fragouli, C.\"],\"key\":\"tuninetti_processing_2004\",\"id\":\"tuninetti_processing_2004\",\"bibbaseid\":\"tuninetti-fragouli-processingalongthewayforwardingvscoding-2004\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"We consider a source that transmits information to a receiver by routing it over a communication network represented by a graph and examine rate benefits that finite complexity processing at the intermediate nodes may offer. We show that there exist configurations where the optimal rate is achieved only when coding across independent information streams (channel coding and routing cannot be separated); that optimal processing is a function of the particular set of channel parameters and not only of the network topology; and that there exists a connection between linear codes and routing for a special class of graphs.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Tuninetti\"],\"firstnames\":[\"D.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"ISIT\",\"tags\":\"network_coding\",\"title\":\"On the throughput improvement due to limited complexity processing at relay nodes\",\"year\":\"2005\",\"bibtex\":\"@article{tuninetti_throughput_2005,\\n abstract = {We consider a source that transmits information to a receiver by routing it over a communication network represented by a graph and examine rate benefits that finite complexity processing at the intermediate nodes may offer. We show that there exist configurations where the optimal rate is achieved only when coding across independent information streams (channel coding and routing cannot be separated); that optimal processing is a function of the particular set of channel parameters and not only of the network topology; and that there exists a connection between linear codes and routing for a special class of graphs.},\\n type={4},\\n author = {Tuninetti, D. and Fragouli, C.},\\n journal = {ISIT},\\n tags = {network_coding},\\n title = {On the throughput improvement due to limited complexity processing at relay nodes},\\n year = {2005}\\n}\\n\\n\",\"author_short\":[\"Tuninetti, D.\",\"Fragouli, C.\"],\"key\":\"tuninetti_throughput_2005\",\"id\":\"tuninetti_throughput_2005\",\"bibbaseid\":\"tuninetti-fragouli-onthethroughputimprovementduetolimitedcomplexityprocessingatrelaynodes-2005\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"Replication is a widely used method to protect largescale data storage systems from data loss when storage nodes fail. It is well known that the placement of replicas of the different data blocks across the nodes affects the time to rebuild. Several systems described in the literature are designed based on the premise that minimizing the rebuild times maximizes the system reliability. Our results however indicate that the reliability is essentially unaffected by the replica placement scheme. We show that, for a replication factor of two, all possible placement schemes have mean times to data loss (MTTDLs) within a factor of two for practical values of the failure rate, storage capacity, and rebuild bandwidth of a storage node. The theoretical results are confirmed by means of event-driven simulation. For higher replication factors, an analytical derivation of MTTDL becomes intractable for a general placement scheme. We therefore use one of the alternate measures of reliability that have been proposed in the literature, namely, the probability of data loss during rebuild in the critical mode of the system. Whereas for a replication factor of two this measure can be directly translated into MTTDL, it is only speculative of the MTTDL behavior for higher replication factors. This measure of reliability is shown to lie within a factor of two for all possible placement schemes and any replication factor. We also show that for any replication factor, the clustered placement scheme has the lowest probability of data loss during rebuild in critical mode among all possible placement schemes, whereas the declustered placement scheme has the highest probability. Simulation results reveal however that these properties do not hold for the corresponding MTTDLs for a replication factor greater than two. This indicates that some alternate measures of reliability may not be appropriate for comparing the MTTDL of different placement schemes.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Venkatesan\"],\"firstnames\":[\"Vinodh\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Iliadis\"],\"firstnames\":[\"Ilias\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hu\"],\"firstnames\":[\"Xiao-Yu\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Haas\"],\"firstnames\":[\"Robert\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"journal\":\"Modeling, Analysis, and Simulation of Computer Systems, International Symposium on\",\"pages\":\"79–88\",\"tags\":\"storage\",\"title\":\"Effect of Replica Placement on the Reliability of Large-Scale Data Storage Systems\",\"volume\":\"0\",\"year\":\"2010\",\"bibtex\":\"@article{venkatesan_effect_2010,\\n abstract = {Replication is a widely used method to protect largescale data storage systems from data loss when storage nodes fail. It is well known that the placement of replicas of the different data blocks across the nodes affects the time to rebuild. Several systems described in the literature are designed based on the premise that minimizing the rebuild times maximizes the system reliability. Our results however indicate that the reliability is essentially unaffected by the replica placement scheme. We show that, for a replication factor of two, all possible placement schemes have mean times to data loss (MTTDLs) within a factor of two for practical values of the failure rate, storage capacity, and rebuild bandwidth of a storage node. The theoretical results are confirmed by means of event-driven simulation. For higher replication factors, an analytical derivation of MTTDL becomes intractable for a general placement scheme. We therefore use one of the alternate measures of reliability that have been proposed in the literature, namely, the probability of data loss during rebuild in the critical mode of the system. Whereas for a replication factor of two this measure can be directly translated into MTTDL, it is only speculative of the MTTDL behavior for higher replication factors. This measure of reliability is shown to lie within a factor of two for all possible placement schemes and any replication factor. We also show that for any replication factor, the clustered placement scheme has the lowest probability of data loss during rebuild in critical mode among all possible placement schemes, whereas the declustered placement scheme has the highest probability. Simulation results reveal however that these properties do not hold for the corresponding MTTDLs for a replication factor greater than two. This indicates that some alternate measures of reliability may not be appropriate for comparing the MTTDL of different placement schemes.},\\n type={4},\\n author = {Venkatesan, Vinodh and Iliadis, Ilias and Hu, Xiao-Yu and Haas, Robert and Fragouli, C.},\\n journal = {Modeling, Analysis, and Simulation of Computer Systems, International Symposium on},\\n pages = {79--88},\\n tags = {storage},\\n title = {Effect of {Replica} {Placement} on the {Reliability} of {Large}-{Scale} {Data} {Storage} {Systems}},\\n volume = {0},\\n year = {2010}\\n}\\n\\n\",\"author_short\":[\"Venkatesan, V.\",\"Iliadis, I.\",\"Hu, X.\",\"Haas, R.\",\"Fragouli, C.\"],\"key\":\"venkatesan_effect_2010-1\",\"id\":\"venkatesan_effect_2010-1\",\"bibbaseid\":\"venkatesan-iliadis-hu-haas-fragouli-effectofreplicaplacementonthereliabilityoflargescaledatastoragesystems-2010\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Venkatesan\"],\"firstnames\":[\"Vinodh\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Iliadis\"],\"firstnames\":[\"Ilias\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Urbanke\"],\"firstnames\":[\"R.\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)\",\"month\":\"August\",\"tags\":\"storage\",\"title\":\"Reliability of clustered vs. declustered replica placement in data storage systems\",\"year\":\"2011\",\"bibtex\":\"@inproceedings{venkatesan_reliability_2011,\\n type={4},\\n author = {Venkatesan, Vinodh and Iliadis, Ilias and Fragouli, C. and Urbanke, R.},\\n booktitle = {{IEEE} {International} {Symposium} on {Modeling}, {Analysis} and {Simulation} of {Computer} and {Telecommunication} {Systems} ({MASCOTS})},\\n month = {August},\\n tags = {storage},\\n title = {Reliability of clustered vs. declustered replica placement in data storage systems},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Venkatesan, V.\",\"Iliadis, I.\",\"Fragouli, C.\",\"Urbanke, R.\"],\"key\":\"venkatesan_reliability_2011-1\",\"id\":\"venkatesan_reliability_2011-1\",\"bibbaseid\":\"venkatesan-iliadis-fragouli-urbanke-reliabilityofclusteredvsdeclusteredreplicaplacementindatastoragesystems-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"4\",\"abstract\":\"Energy efficiency, i.e., the amount of battery energy consumed to transmit bits across a wireless link, is a critical design parameter for wireless ad-hoc networks. This paper examines the problem of broadcasting information to all nodes in an ad-hoc network, when a large percentage of the nodes act as sources. For this application, we theoretically quantify the energy savings that network coding can offer in the cases of a line network and a rectangular grid network. We then propose low-complexity distributed algorithms, and demonstrate through simulation that in practice, for random networks, network coding can in fact offer significant benefits in terms of energy consumption.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Widmer\"],\"firstnames\":[\"J.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"firstnames\":[\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Le\",\"Boudec\"],\"firstnames\":[\"J.-Y.\"],\"suffixes\":[]}],\"journal\":\"1st Network Coding Workshop\",\"tags\":\"network_coding,wireless\",\"title\":\"Low-complexity energy-efficient broadcasting in wireless ad-hoc networks using network coding\",\"year\":\"2005\",\"bibtex\":\"@article{widmer_low-complexity_2005,\\n abstract = {Energy efficiency, i.e., the amount of battery energy consumed to transmit bits across a wireless link, is a critical design parameter for wireless ad-hoc networks. This paper examines the problem of broadcasting information to all nodes in an ad-hoc network, when a large percentage of the nodes act as sources. For this application, we theoretically quantify the energy savings that network coding can offer in the cases of a line network and a rectangular grid network. We then propose low-complexity distributed algorithms, and demonstrate through simulation that in practice, for random networks, network coding can in fact offer significant benefits in terms of energy consumption.},\\n type={4},\\n author = {Widmer, J. and Fragouli, C. and Le Boudec, J.-Y.},\\n journal = {1st Network Coding Workshop},\\n tags = {network_coding,wireless},\\n title = {Low-complexity energy-efficient broadcasting in wireless ad-hoc networks using network coding},\\n year = {2005}\\n}\\n\\n\",\"author_short\":[\"Widmer, J.\",\"Fragouli, C.\",\"Le Boudec, J.\"],\"key\":\"widmer_low-complexity_2005\",\"id\":\"widmer_low-complexity_2005\",\"bibbaseid\":\"widmer-fragouli-leboudec-lowcomplexityenergyefficientbroadcastinginwirelessadhocnetworksusingnetworkcoding-2005\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"fragouli, c\":\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1\"}},\"downloads\":0,\"html\":\"\"}],\n      metadata: {\"authorlinks\":{}},\n      ownerID: undefined\n    };\n  </script>\n\n  <script type=\"text/javascript\">\n  var site$;\n  if (typeof $ != 'undefined') {\n    console.log('existing jquery: storing and then restoring');\n    site$ = $;\n    $ = null;\n  }\n  </script>\n\n  <script src=\"https://ajax.googleapis.com/ajax/libs/jquery/2.2.4/jquery.min.js\">\n  </script>\n  <script type=\"text/javascript\">\n  if (site$) {\n    console.log('existing jquery: avoiding conflict and restoring');\n    bb$ = $.noConflict(true);\n    $ = site$;\n  } else {\n    bb$ = $;\n  }\n  </script>\n\n  <script src=\"//bibbase.org/js/bibbase.min.js\"\n          type=\"text/javascript\">\n  </script>\n\n  <script type=\"text/javascript\"\n          src=\"https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML\">\n  </script>\n  <script type=\"text/x-mathjax-config\">\n    MathJax.Hub.Config({tex2jax: {inlineMath: [['$','$'], ['\\\\(','\\\\)']]},\n                        skipTags: [\"body\"],\n                        processClass: \"bibbase_paper\"});\n  </script>\n\n  <style>\n  @media print {\n    .dontprint {\n        display: none !important;\n    }\n\n  .bibbase_group {\n    background-color: #E0E0E0;\n    font-style: italic;\n    font-size: larger;\n    text-shadow: 0px 0px 3px #FFFFFF;\n    border-radius: 4px 4px 4px 4px;\n    -moz-border-radius: 4px 4px 4px 4px;\n    -webkit-border-radius: 4px;\n    padding: 5px 40px 5px;\n    margin-top: 10px;\n    margin-bottom: 5px;\n    cursor: pointer;\n  }\n\n  .bibbase_paper {\n    margin-bottom: 5px;\n  }\n\n  }\n  </style>\n\n  \n  <div style=\"float: right; margin-right: 10px; margin-top: 10px; text-align: right; font-size: 12px\">\n    generated by\n    <a href=\"//bibbase.org\"\n       onclick=\"trackOutboundLink('bibbase', 'logo clicked', window.location.href, '//bibbase.org'); return false;\">\n      <img src=\"//bibbase.org/img/logo.svg\"\n           style=\"vertical-align: middle; margin-left: 3px; height: 16px;\"/\n           alt=\"bibbase.org\"\n           title=\"BibBase – The easiest way to maintain your publications page.\"\n        ></a>\n    \n  </div>\n  \n\n  <div id=\"bibbase_header\" class=\"dontprint\" style=\"\">\n\n    <ul class=\"nav nav-pills\" style=\"margin: 0px;\">\n\n      <li class=\"dropdown\" id=\"groupby_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\">\n          Group by\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li class=\"groupby year\"><a onclick=\"groupby('year')\">\n            Year</a>\n        </li>\n        <li class=\"groupby author\"><a onclick=\"groupby('author_short')\">\n            Author</a>\n        </li>\n        <li class=\"groupby type\"><a onclick=\"groupby('type')\">\n            Type</a>\n        </li>\n        <li class=\"groupby keyword\"><a onclick=\"groupby('keyword')\">\n            Keyword</a>\n        </li>\n        <li class=\"groupby downloads\"><a onclick=\"groupby('downloads')\">\n            Downloads</a>\n        </li>\n      </ul>\n      </li>\n\n\n      <li class=\"dropdown\" id=\"menu_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\" alt=\"controls\">\n          <i class=\"fa fa-reorder\" alt=\"controls\"></i>\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li>\n          <a onclick=\"toggleAll()\">\n            <i class=\"fa fa-chevron-down fa-fw\"></i> Expand/Collapse All\n          </a>\n        </li>\n        <li>\n          <a download=\"52xaJNXvSgauGDmZR\" href=\"data:text/bibtex;base64,@ARTICLE{8684919,
  type={2},
  tags={na},
  author={Karmoose, Mohammed and Fragouli, Christina and Diggavi, Suhas and Misoczki, Rafael and Yang, Lily L. and Zhang, Zhenliang},
  journal={IEEE Communications Letters}, 
  title={Using mm-Waves for Secret Key Establishment}, 
  year={2019},
  volume={23},
  number={6},
  pages={1077-1080},
  doi={10.1109/LCOMM.2019.2909918}}




@ARTICLE{8742589,
  type={2},
  tags={na},
  author={Ezzeldin, Yahya H. and Cardone, Martina and Fragouli, Christina and Tuninetti, Daniela},
  journal={IEEE Transactions on Information Theory}, 
  title={Network Simplification in Half-Duplex: Building on Submodularity}, 
  year={2019},
  volume={65},
  number={10},
  pages={6801-6818},
  doi={10.1109/TIT.2019.2923994}}




@INPROCEEDINGS{8849556,
  type={2},
  tags={na},
  author={Song, Linqi and Fragouli, Christina and Shah, Devavrat},
  booktitle={2019 IEEE International Symposium on Information Theory (ISIT)}, 
  title={Interactions Between Learning and Broadcasting in Wireless Recommendation Systems}, 
  year={2019},
  volume={},
  number={},
  pages={2549-2553},
  doi={10.1109/ISIT.2019.8849556}}




@ARTICLE{8906011,
  type={2},
  tags = {network_coding},
  author={Song, Linqi and Fragouli, Christina and Zhao, Tianchu},
  journal={IEEE Transactions on Information Theory}, 
  title={A Pliable Index Coding Approach to Data Shuffling}, 
  year={2020},
  volume={66},
  number={3},
  pages={1333-1353},
  doi={10.1109/TIT.2019.2954338}}




@ARTICLE{8922781,
  type={2},
  tags={na},
  author={Karmoose, Mohammed and Song, Linqi and Cardone, Martina and Fragouli, Christina},
  journal={IEEE Transactions on Information Theory}, 
  title={Privacy in Index Coding:  $k$ -Limited-Access Schemes}, 
  year={2020},
  volume={66},
  number={5},
  pages={2625-2641},
  doi={10.1109/TIT.2019.2957577}}




@INPROCEEDINGS{8988985,
  type={2},
  tags={na},
  author={Agarwal, Gaurav Kumar and Cardone, Martina and Fragouli, Christina},
  booktitle={2019 IEEE Information Theory Workshop (ITW)}, 
  title={On Secure Capacity of Multiple Unicast Traffic over Separable Networks}, 
  year={2019},
  volume={},
  number={},
  pages={1-5},
  doi={10.1109/ITW44776.2019.8988985}}




@ARTICLE{9103123,
  type={2},
  tags={na},
  author={Ezzeldin, Yahya H. and Cardone, Martina and Fragouli, Christina and Tuninetti, Daniela},
  journal={IEEE Transactions on Information Theory}, 
  title={The Approximate Capacity of Half-Duplex Line Networks}, 
  year={2020},
  volume={66},
  number={7},
  pages={4449-4467},
  doi={10.1109/TIT.2020.2998184}}




@ARTICLE{9112310,
  type={2},
  tags = {security},
  author={Mao, Yanwen and Diggavi, Suhas and Fragouli, Christina and Tabuada, Paulo},
  journal={IEEE Control Systems Letters}, 
  title={Secure State-Reconstruction Over Networks Subject to Attacks}, 
  year={2021},
  volume={5},
  number={1},
  pages={157-162},
  doi={10.1109/LCSYS.2020.3000853}}




@ARTICLE{9133260,
  type={2},
  tags = {security},
  author={Agarwal, Gaurav Kumar and Karmoose, Mohammed and Diggavi, Suhas and Fragouli, Christina and Tabuada, Paulo},
  journal={IEEE Transactions on Automatic Control}, 
  title={Distortion-Based Lightweight Security for Cyber-Physical Systems}, 
  year={2021},
  volume={66},
  number={4},
  pages={1588-1601},
  doi={10.1109/TAC.2020.3006814}}




@ARTICLE{9145607,
  type={2},
  tags={na},
  author={Ezzeldin, Yahya H. and Sengupta, Ayan and Fragouli, Christina},
  journal={IEEE Transactions on Information Theory}, 
  title={Wireless Network Simplification: The Performance of Routing}, 
  year={2020},
  volume={66},
  number={9},
  pages={5703-5711},
  doi={10.1109/TIT.2020.3010990}}




@INPROCEEDINGS{9174130,
  type={4},
  tags = {bio},
  author={Srinivasavaradhan, Sundara Rajan and Diggavi, Suhas and Fragouli, Christina},
  booktitle={2020 IEEE International Symposium on Information Theory (ISIT)}, 
  title={Equivalence of ML decoding to a continuous optimization problem}, 
  year={2020},
  volume={},
  number={},
  pages={343-348},
  doi={10.1109/ISIT44484.2020.9174130}}




@INPROCEEDINGS{9174233,
  type={4},
  tags = {wireless},
  author={Ezzeldin, Yahya H. and Cardone, Martina and Fragouli, Christina and Caire, Giuseppe},
  booktitle={2020 IEEE International Symposium on Information Theory (ISIT)}, 
  title={Gaussian 1-2-1 Networks with Imperfect Beamforming}, 
  year={2020},
  volume={},
  number={},
  pages={1599-1604},
  doi={10.1109/ISIT44484.2020.9174233}}




@INPROCEEDINGS{9174297,
  type={4},
  tags = {na},
  author={Li, Tan and Song, Linqi and Fragouli, Christina},
  booktitle={2020 IEEE International Symposium on Information Theory (ISIT)}, 
  title={Federated Recommendation System via Differential Privacy}, 
  year={2020},
  volume={},
  number={},
  pages={2592-2597},
  doi={10.1109/ISIT44484.2020.9174297}}




@ARTICLE{9239329,
  type={2},
  tags = {bio,channel_coding},
  author={Srinivasavaradhan, Sundara Rajan and Du, Michelle and Diggavi, Suhas N. and Fragouli, Christina},
  journal={IEEE Transactions on Information Theory}, 
  title={Algorithms for Reconstruction Over Single and Multiple Deletion Channels}, 
  year={2021},
  volume={67},
  number={6},
  pages={3389-3410},
  doi={10.1109/TIT.2020.3033513}}




@ARTICLE{9244138,
  type={2},
  tags = {wireless},
  author={Ezzeldin, Yahya H. and Cardone, Martina and Fragouli, Christina and Caire, Giuseppe},
  journal={IEEE Transactions on Information Theory}, 
  title={Gaussian 1-2-1 Networks: Capacity Results for mmWave Communications}, 
  year={2021},
  volume={67},
  number={2},
  pages={961-990},
  doi={10.1109/TIT.2020.3034569}}




@ARTICLE{9270285,
  type={2},
  tags={na},
  author={Girgis, Antonious M. and Data, Deepesh and Chaudhuri, Kamalika and Fragouli, Christina and Diggavi, Suhas N.},
  journal={IEEE Journal on Selected Areas in Information Theory}, 
  title={Successive Refinement of Privacy}, 
  year={2020},
  volume={1},
  number={3},
  pages={745-759},
  doi={10.1109/JSAIT.2020.3040403}}




@ARTICLE{9448027,
type={2},
  author={Song, Xiaoshen and Ezzeldin, Yahya H. and Caire, Giuseppe and Fragouli, Christina},
  journal={IEEE Transactions on Communications}, 
  title={Efficient Beam Scheduling for Half-Duplex mmWave Relay Networks}, 
  year={2021},
  volume={69},
  number={9},
  tags = {wireless},
  pages={5773-5789},
  doi={10.1109/TCOMM.2021.3087203}}




@INPROCEEDINGS{9457663,
  type={4},
  author={Ezzeldin, Yahya H. and Cardone, Martina and Fragouli, Christina},
  booktitle={2020 IEEE Information Theory Workshop (ITW)}, 
  title={Multilevel Secrecy over 1-2-1 Networks}, 
  year={2021},
  volume={},
  number={},
  tags = {wireless,security},
  pages={1-5},
  doi={10.1109/ITW46852.2021.9457663}}




@INPROCEEDINGS{9517757,
  type={4},
  tags={wireless,mine},
  author={Dogan, Mine Gokce and Ezzeldin, Yahya H. and Fragouli, Christina},
  booktitle={2021 IEEE International Symposium on Information Theory (ISIT)}, 
  title={On optimal relay placement in directional networks}, 
  year={2021},
  volume={},
  number={},
  pages={3156-3161},
  doi={10.1109/ISIT45174.2021.9517757}}




@INPROCEEDINGS{9518188,
  type={4},
  tags={group_testing,pavlos},
  author={Srinivasavaradhan, Sundara Rajan and Nikolopoulos, Pavlos and Fragouli, Christina and Diggavi, Suhas},
  booktitle={2021 IEEE International Symposium on Information Theory (ISIT)}, 
  title={An entropy reduction approach to continual testing}, 
  year={2021},
  volume={},
  number={},
  pages={611-616},
  doi={10.1109/ISIT45174.2021.9518188}}




@ARTICLE{9521982,
  type={2},
  tags={osama},
  author={Hanna, Osama A. and Ezzeldin, Yahya H. and Fragouli, Christina and Diggavi, Suhas},
  journal={IEEE Journal on Selected Areas in Information Theory}, 
  title={Quantization of Distributed Data for Learning}, 
  year={2021},
  volume={2},
  number={3},
  pages={987-1001},
  tags = {ML_CC},
  doi={10.1109/JSAIT.2021.3105359}}




@ARTICLE{9609622,
  type={2},
  tags={group_testing,pavlos},
  author={Nikolopoulos, Pavlos and Srinivasavaradhan, Sundara Rajan and Fragouli, Christina and Diggavi, Suhas N.},
  journal={IEEE BITS the Information Theory Magazine}, 
  title={Group Testing for Community Infections}, 
  year={2021},
  volume={1},
  number={1},
  pages={57-68},
  doi={10.1109/MBITS.2021.3126244}}




@INPROCEEDINGS{9652975,
  type={4},
  tags = {na},
  author={Bunton, Jonathan and Anevlavis, Tzanis and Verma, Gunjan and Fragouli, Christina and Tabuada, Paulo},
  booktitle={MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)}, 
  title={Split to win: near-optimal sensor network synthesis via path-greedy subproblems}, 
  year={2021},
  volume={},
  number={},
  pages={789-794},
  doi={10.1109/MILCOM52596.2021.9652975}}




@INPROCEEDINGS{9653135,
  type={4},
  tags = {wireless,mine},
  author={Dogan, Mine Gokce and Ezzeldin, Yahya H. and Fragouli, Christina and Bohannon, Addison W.},
  booktitle={MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)}, 
  title={A Reinforcement Learning Approach for Scheduling in mmWave Networks}, 
  year={2021},
  volume={},
  number={},
  pages={771-776},
  doi={10.1109/MILCOM52596.2021.9653135}}



@INPROCEEDINGS{9834416,
  type={4},
  tags={wireless,mine},
  author={Dogan, Mine Gokce and Cardone, Martina and Fragouli, Christina},
  booktitle={2022 IEEE International Symposium on Information Theory (ISIT)}, 
  title={Proactive Resilience in 1-2-1 Networks}, 
  year={2022},
  volume={},
  number={},
  pages={3220-3225},
  doi={10.1109/ISIT50566.2022.9834416}}




@INPROCEEDINGS{9834577,
  type={4},
  tags={group_testing,pavlos},
  author={Srinivasavaradhan, Sundara Rajan and Nikolopoulos, Pavlos and Fragouli, Christina and Diggavi, Suhas},
  booktitle={2022 IEEE International Symposium on Information Theory (ISIT)}, 
  title={Improving Group Testing via Gradient Descent}, 
  year={2022},
  volume={},
  number={},
  pages={2243-2248},
  doi={10.1109/ISIT50566.2022.9834577}}





@INPROCEEDINGS{9834790,
  type={4},
  tags={ML_CC,osama,xinlin},
  author={Hanna, Osama A. and Li, Xinlin and Fragouli, Christina and Diggavi, Suhas},
  booktitle={2022 IEEE International Symposium on Information Theory (ISIT)}, 
  title={Can we break the dependency in distributed detection?}, 
  year={2022},
  volume={},
  number={},
  pages={2720-2725},
  doi={10.1109/ISIT50566.2022.9834790}}




@INPROCEEDINGS{9834823,
  type={4},
  tags = {group_testing,pavlos},
  author={Srinivasavaradhan, Sundara Rajan and Nikolopoulos, Pavlos and Fragouli, Christina and Diggavi, Suhas},
  booktitle={2022 IEEE International Symposium on Information Theory (ISIT)}, 
  title={Dynamic group testing to control and monitor disease progression in a population}, 
  year={2022},
  volume={},
  number={},
  pages={2255-2260},
  doi={10.1109/ISIT50566.2022.9834823}}





@inproceedings{yao2023diagonal,
  type={4},
  tags={chaorui,pavlos},
  title={A Diagonal Splitting Algorithm for Adaptive Group Testing},
  author={Yao, Chaorui and Nikolopoulos, Pavlos and Fragouli, Christina},
  booktitle={2023 IEEE International Symposium on Information Theory (ISIT)},
  pages={1842--1847},
  year={2023},
  organization={IEEE},
  doi={10.1109/ISIT54713.2023.10206936}
}



@inproceedings{hanna2023common,
  type={4},
  tags={xinlin,osama},
  title={Common information dimension},
  author={Hanna, Osama A and Li, Xinlin and Diggavi, Suhas and Fragouli, Christina},
  booktitle={2023 IEEE International Symposium on Information Theory (ISIT)},
  pages={406--411},
  year={2023},
  organization={IEEE}
}



@inproceedings{vestergaard2021coded,
  tags={osama},
  title={On Coded Broadcasting for Wireless Recommendation Systems},
  author={Vestergaard, Rasmus and Hanna, Osama and Song, Linqi and Lucani, Daniel E and Fragouli, Christina},
  booktitle={ICC 2021-IEEE International Conference on Communications},
  pages={1--6},
  year={2021},
  organization={IEEE}
}



@article{hanna2023compression,
  tags={osama},
  title={Compression for Multi-Arm Bandits},
  author={Hanna, Osama A and Yang, Lin F and Fragouli, Christina},
  journal={IEEE Journal on Selected Areas in Information Theory},
  year={2023},
  publisher={IEEE}
}



@inproceedings{kalor2018random,
  tags={osama},
  title={Random access schemes in wireless systems with correlated user activity},
  author={Kalor, Anders E and Hanna, Osama A and Popovski, Petar},
  booktitle={2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)},
  pages={1--5},
  year={2018},
  organization={IEEE}
}



@article{ellersgaard2018random,
  tags={osama},
  title={Random Access Schemes in Wireless Systems With Correlated User Activity},
  author={Ellersgaard Kal{\o}r, Anders and Hanna, Osama A and Popovski, Petar},
  journal={arXiv e-prints},
  pages={arXiv--1803},
  year={2018}
}



@article{hanna2022learning,
  tags={osama},
  title={Learning in distributed contextual linear bandits without sharing the context},
  author={Hanna, Osama A and Yang, Lin F and Fragouli, Christina},
  journal={arXiv preprint arXiv:2206.04180},
  year={2022}
}



@inproceedings{hanna2023contexts,
  tags={osama},
  title={Contexts can be cheap: Solving stochastic contextual bandits with linear bandit algorithms},
  author={Hanna, Osama A and Yang, Lin and Fragouli, Christina},
  booktitle={The Thirty Sixth Annual Conference on Learning Theory},
  pages={1791--1821},
  year={2023},
  organization={PMLR}
}



@article{hanna2022learning2,
  tags={osama},
  title={Learning from Distributed Users in Contextual Linear Bandits Without Sharing the Context},
  author={Hanna, Osama and Yang, Lin and Fragouli, Christina},
  journal={Advances in Neural Information Processing Systems},
  volume={35},
  pages={11049--11062},
  year={2022}
}




@article{hanna2022differentially,
  tags={osama},
  title={Differentially private stochastic linear bandits:(almost) for free},
  author={Hanna, Osama A and Girgis, Antonious M and Fragouli, Christina and Diggavi, Suhas},
  journal={arXiv preprint arXiv:2207.03445},
  year={2022}
}




@inproceedings{hanna2023multi,
  type={4},
  tags={merve,osama},
  title={Multi-Arm Bandits over Action Erasure Channels},
  author={Hanna, Osama A and Karakas, Merve and Yang, Lin F and Fragouli, Christina},
  booktitle={2023 IEEE International Symposium on Information Theory (ISIT)},
  pages={1312--1317},
  year={2023},
  organization={IEEE}
}



@article{hanna2023efficient,
  tags={osama},
  title={Efficient Batched Algorithms for Contextual Linear Bandits with Large Action Space via Soft Elimination},
  author={Hanna, Osama and Yang, Lin and Fragouli, Christina},
  journal={Advances in Neural Information Processing Systems},
  volume={},
  pages={},
  year={2023}
}



% Updated by Xinlin @ 2022-Aug.



@article{dogan2022gomory,
  type={2},
  tags={na,mine},
  title={Gomory-hu trees over wireless},
  author={Dogan, Mine Gokce and Ezzeldin, Yahya H and Fragouli, Christina},
  journal={IEEE Communications Letters},
  volume={26},
  number={5},
  pages={1004--1007},
  year={2022},
  publisher={IEEE}
}




@INPROCEEDINGS{Hanna2022SolvingMB,
  type={4},
  tags={ML_CC,osama},
  author={Osama A. Hanna and Lin F. Yang and Christina Fragouli},
  booktitle={International Conference on Artificial Intelligence and Statistics}, 
  title={Solving Multi-Arm Bandit Using a Few Bits of Communication},
  year={2022},
  pages={3220-3225}}




@InProceedings{pmlr-v130-nikolopoulos21a,
  type={4},
  tags={group_testing,pavlos},
  title =  { Group testing for connected communities },
  author =  {Nikolopoulos, Pavlos and Rajan Srinivasavaradhan, Sundara and Guo, Tao and Fragouli, Christina and Diggavi, Suhas},
  booktitle =  {Proceedings of The 24th International Conference on Artificial Intelligence and Statistics},
  pages =  {2341--2349},
  year = {2021},
  editor = {Banerjee, Arindam and Fukumizu, Kenji},
  volume = {130},
  series = {Proceedings of Machine Learning Research},
  month =  {13--15 Apr},
  publisher =    {PMLR},
  pdf =    {http://proceedings.mlr.press/v130/nikolopoulos21a/nikolopoulos21a.pdf},
  url =    {https://proceedings.mlr.press/v130/nikolopoulos21a.html}
}




@inproceedings{vestergaard2021coded,
  type={4},
  tags={osama},
  title={On Coded Broadcasting for Wireless Recommendation Systems},
  author={Vestergaard, Rasmus and Hanna, Osama and Song, Linqi and Lucani, Daniel E and Fragouli, Christina},
  booktitle={ICC 2021-IEEE International Conference on Communications},
  pages={1--6},
  year={2021},
  tags = {ML_CC},
  organization={IEEE}
}




@inproceedings{nikolopoulos2020ICC,
  type={4},
  tags = {group_testing,pavlos},
  author = {Nikolopoulos, Pavlos and Srinivasavaradhan, Sundara Rajan and Guo, Tao and Fragouli, Christina and Diggavi, Suhas},
  booktitle = {{IEEE} {International} {Conference on} {Communications} ({ICC})},
  title = {Group testing for overlapping communities},
  month = July,
  year = {2021}
}




@article{agarwal_secure_2020,
 type={2},
 author = {Agarwal, G. K. and Cardone, M. and Fragouli, C.},
 journal = {IEEE Transactions on Information Theory},
 tags = {security},
 title = {On secure network coding for multiple unicast traffic},
 year = {2020}
}



@article{nikolopoulos2020community,
  type={1},
  title={Community aware group testing},
  author={Nikolopoulos, Pavlos and Guo, Tao and Srinivasavaradhan, Sundara Rajan and Fragouli, Christina and Diggavi, Suhas},
  journal={arXiv preprint arXiv:2007.08111},
  tags = {group_testing},
  month = July,
  year={2020}
}

% @article{nikolopoulos2020group,
%   type={1},
%   title={Group testing for overlapping communities},
%   author={Nikolopoulos, Pavlos and Srinivasavaradhan, Sundara Rajan and Guo, Tao and Fragouli, Christina and Diggavi, Suhas},
%   journal={arXiv preprint arXiv:2012.02804},
%   tags = {group_testing},
%   month = dec,
%   year={2020}
% }




@inproceedings{rebanal_distorting_2020,
 type={4},
 author = {Rebanal, J. C. and Ezzeldin, Y. H. and and Fragouli, C. and Tabuada, P.},
 booktitle = {{IEEE} Globecom},
 tags = {channel_coding},
 title = {A coding approach to localization using landmarks},
 year = {2020}
}




@article{hanna_distributed_2020,
 type={2},
 tags={osama},
 author = {Hanna, O. A. and Ezzeldin, Y. H. and Sadjadpour, T. and Fragouli, C. and Diggavi, S.},
 journal = {IEEE Journal on Selected Areas in Information Theory},
 tags = {ML_CC},
 title = {On Distributed Quantization for Classification},
 year = {2020}
}


% @article{srinivasavaradhan2020algorithms,
%   type={1},
%   title={Algorithms for reconstruction over single and multiple deletion channels},
%   author={Srinivasavaradhan, SR and Du, Michelle and Diggavi, S. and Fragouli, C.},
%   journal={arXiv preprint arXiv:2005.14388},
%   tags = {bio,channel_coding},
%   year={2020}
% }




@inproceedings{song_interactions_2019,
 type={4},
 author = {Song, L. and Fragouli, C. and Shah, D.},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 tags = {ML_CC},
 title = {Interactions {Between} {Learning} and {Broadcasting} in {Wireless} {Recommendation} {Systems}},
 year = {2019}
}




@article{ezzeldin_quantizing_2019,
 type={4},
 author = {Ezzeldin, Y. H. and Fragouli, C. and Diggavi, S. N.},
 journal = {IEEE International Symposium of Information Theory (ISIT)},
 tags = {ML_CC},
 title = {Quantizing Signals for Linear Classification},
 year = {2019}
}




@inproceedings{agarwal_distorting_2018,
 type={4},
 author = {Agarwal, G. K. and Karmoose, M. and Diggavi, S. and Fragouli, C. and Tabuada, P.},
 booktitle = {{IEEE} {Conference} on {Decision} and {Control} ({CDC})},
 tags = {security},
 title = {Distorting an {Adversary}'s {View} in {Cyber}-{Physical} {Systems}},
 year = {2018}
}




@article{al-dhahir_how_2002,
 abstract = {In this paper, we address the following problem. Given a fixed total number of feedforward and feedback filter taps in a decision feedback equalizer, what is the optimum number of taps of each filter and what is the optimum delay setting? We propose a simple algorithm that reduces the solution search space from being two-dimensional to one-dimensional at a small performance loss. We demosntrate the application of our algorithm for indoor wireless channels.},
 type={4},
 author = {Al-Dhahir, N. and Fragouli, C.},
 journal = {CISS 2002},
 tags = {wireless},
 title = {How to choose the number of taps in a {DFE}?},
 year = {2002}
}



@inproceedings{dhulipala_single_2007,
 abstract = {Communication complexity of computing functions using unrestricted communication and one-round communication are compared. In the standard unrestricted communication each party could potentially communicate several times while in one-round communication each party is restricted to communicate at most once. Results on the ratio of these two complexities are provided for symmetric and asymmetric functions under different scenarios. These results are suitably illustrated with examples.},
 type={4},
 author = {Dhulipala, Anand K. and Fragouli, C. and Orlitsky, Alon},
 booktitle = {Information {Theory}, 2007. {ISIT} 2007. {IEEE} {International} {Symposium} on},
 doi = {10.1109/isit.2007.4557296},
 month = {June},
 pages = {636 --640},
 tags = {CC},
 title = {Single versus multiple rounds for distributed function computation},
 year = {2007}
}



@inproceedings{ezzeldin_communication_2017,
 type={4},
 author = {Ezzeldin, Y. H. and Karmoose, M. and Fragouli, C.},
 booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},
 tags = {ML_CC},
 title = {Communication vs Distributed Computation: an alternative trade-off curve},
 year = {2017}
}




@inproceedings{gatzianas_feedback-based_2012,
 type={4},
 author = {Gatzianas, Marios and Saeedi, Shirin and Fragouli, C.},
 booktitle = {Proceedings {NETCOD}},
 month = {June},
 tags = {wireless,network_coding},
 title = {Feedback-based coding algorithms for broadcast erasure channels with degraded message sets},
 year = {2012}
}




@inproceedings{karamchandani_function_2010,
 abstract = {This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.},
 type={4},
 author = {Karamchandani, Nikhil and Keller, L. and Fragouli, C. and Franceschetti, Massimo},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 doi = {10.1109/isit.2010.5513755},
 tags = {wireless,network_coding},
 title = {Function computation via subspace coding},
 year = {2010}
}



@inproceedings{keller_function_2010,
 abstract = {This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.},
 type={4},
 author = {Keller, L. and Karamchandani, Nikhil and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} on {Network} {Coding} ({NetCod})},
 doi = {10.1109/NETCOD.2010.5487679},
 tags = {wireless,network_coding},
 title = {Function computation over linear channels},
 year = {2010}
}



@inproceedings{keller_network_2011,
 abstract = {This paper experimentally studies the reliability and delay of flooding based multicast protocols for a sniper detection application. In particular using an emulator it studies under which conditions protocols based on network coding deliver performance improvements compared to classic flooding. It then presents an implementation of such protocols on mobile phones.},
 type={4},
 author = {Keller, L. and Karaagac, A. and Fragouli, C. and Argyraki, K.},
 booktitle = {{IEEE} {Wireless} {Measurements} {Workshop} ({WinMee})},
 month = {May},
 tags = {wireless, network_coding},
 title = {A network coding approach to the sniper detection problem},
 year = {2011}
}



@inproceedings{saeedi_degraded_2011,
 type={4},
 author = {Saeedi, Shirin and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 month = {August},
 tags = {channel_coding,network_coding},
 title = {Degraded two-message multicast over graphs},
 year = {2011}
}



@inproceedings{seferoglu_smartcast_2011,
 abstract = {Video applications are increasingly popular over smartphones. However, in current cellular systems, the downlink data rate fluctuates and the loss rate can be quite high. We are interested in the scenario where a group of smartphone users, within proximity of each other, are interested in viewing the same video at the same time and are also willing to cooperate with each other. We propose a system that maximizes the video quality by appropriately using all available resources, namely the cellular connections to the phones as well as the device-to-device links that can be established via Bluetooth or WiFi. Key ingredients of our design are: (i) the cooperation among users, (ii) network coding, and (iii) exploiting broadcast in the mobile-to-mobile links. Our approach is grounded on a network utility maximization formulation of the problem. We present numerical results that demonstrate the benefit of our approach, and we implement a prototype on android phones.},
 type={4},
 author = {Seferoglu, H. and Keller, L. and Markopoulou, Athina and Fragouli, C.},
 booktitle = {{IEEE} {Allerton} {Conference} on {Communications}, {Control} and {Computing}},
 tags = {wireless,network_coding},
 title = {{SmartCast}: {Cooperative} video streaming on smartphones},
 year = {2011}
}




@inproceedings{srinivasavaradhan_distributed_2018,
 type={4},
 author = {Srinivasavaradhan, SR and Song, L. and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} of {Information} {Theory} ({ISIT})},
 tags = {ML_CC},
 title = {Distributed Computing Trade-offs with Random Connectivity},
 year = {2018}
}




@inproceedings{srinivasavaradhan_maximum_2018,
 type={4},
 author = {Srinivasavaradhan, SR and Du, Michelle and Diggavi, S. and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} of {Information} {Theory} ({ISIT})},
 tags = {bio},
 title = {On Maximum Likelihood Reconstruction over Multiple Deletion Channels},
 year = {2018}
}




@article{venkatesan_effect_2010,
 type={4},
 author = {Venkatesan, Vinodh and Iliadis, Ilias and Hu, Xiao-Yu and Haas, Robert and Fragouli, C.},
 journal = {Modeling, Analysis, and Simulation of Computer Systems, International Symposium on},
 pages = {79--88},
 tags = {storage},
 title = {Effect of {Replica} {Placement} on the {Reliability} of {Large}-{Scale} {Data} {Storage} {Systems}},
 volume = {0},
 year = {2010}
}



@inproceedings{venkatesan_reliability_2011,
 type={4},
 author = {Venkatesan, Vinodh and Iliadis, Ilias and Fragouli, C. and Urbanke, R.},
 booktitle = {{IEEE} {International} {Symposium} on {Modeling}, {Analysis} and {Simulation} of {Computer} and {Telecommunication} {Systems} ({MASCOTS})},
 month = {August},
 tags = {storage},
 title = {Reliability of clustered vs. declustered replica placement in data storage systems},
 year = {2011}
}






@article{agarwal_distortion_2020,
 type={2},
 author = {Agarwal, G. K. and Karmoose, M. and Diggavi, S. and Fragouli, C. and Tabuada, P.},
 journal = {IEEE Transactions on Automatic Control},
 tags = {security},
 title = {Distortion based {Light}-weight {Security} for {Cyber}-{Physical} {Systems}},
 year = {2020}
}



@inproceedings{agarwal_secure_2016,
 type={4},
 author = {Agarwal, G. K. and Cardone, M. and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 tags = {security},
 title = {On {Secure} {Network} {Coding} for {Two} {Unicast} {Sessions}},
 year = {2016}
}



@inproceedings{agarwal_secure_2016-1,
 type={4},
 author = {Agarwal, G. K. and Cardone, M. and Fragouli, C.},
 booktitle = {{IEEE} {Symposium} on {Network} {Coding} ({NetCod})},
 tags = {security},
 title = {On secure network coding for two unicast sessions: studying butterflies},
 year = {2016}
}



@inproceedings{agarwal_secure_2017,
 type={4},
 author = {Agarwal, G. K. and Cardone, M. and Fragouli, C.},
 booktitle = {International {Conference} on {Information} {Theoretic} {Security} ({ICITS})},
 tags = {security},
 title = {Secure {Network} {Coding} for {Multiple} {Unicast}: {On} the {Case} of {Single} {Source}},
 year = {2017}
}



@inproceedings{agarwal_secure_2018,
 type={4},
 author = {Agarwal, G. K. and Ezzeldin, Y. H. and Cardone, M. and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} of {Information} {Theory} ({ISIT})},
 tags = {security},
 title = {Secure {Communication} over 1-2-1 {Networks}},
 year = {2018}
}



@inproceedings{agarwal_secure_2019,
 type={4},
 author = {Agarwal, G. K. and Cardone, M. and Fragouli, C.},
 booktitle = {{IEEE} {International} {Workshop} on {Information} {Theory} ({ITW})},
 tags = {security},
 title = {On {Secure} {Capacity} of {Multiple} {Unicast} {Traffic} over {Separable} {Networks}},
 year = {2019}
}




@article{al-dhahir_how_2002,
 abstract = {In this paper, we address the following problem. Given a fixed total number of feedforward and feedback filter taps in a decision feedback equalizer, what is the optimum number of taps of each filter and what is the optimum delay setting? We propose a simple algorithm that resudes the solution search space from being two-dimensional to one-dimensional at a small performance loss. We demosntrate the application of our algorithm for indoor wireless channels.},
 type={4},
 author = {Al-Dhahir, N. and Fragouli, C.},
 journal = {CISS 2002},
 tags = {wireless},
 title = {How to choose the number of taps in a {DFE}?},
 year = {2002}
}



@article{al-dhahir_space-time_2002,
 abstract = {We present an overview of research activities on space-time coding for broadband wireless transmission performed at AT\&amp;T Shannon Laboratory over the past two years. The emphasis is on physical layer modem algorithms such as channel estimation, equalization, and interference cancellation. However, we also discuss the impact of space-time coding gains at the physical layer on throughput at or above the networking layer. Furthermore, we describe a flexible graphical user interface attached to our physical layer simulation engine in order to explore the performance of space-time codes under a variety of practical transmission scenarios. Simulation results for the EDGE cellular system and the 802.11 wireless LAN environment are presented.},
 type={4},
 author = {Al-Dhahir, N. and Fragouli, C. and Stamoulis, A. and Younis, W. and Calderbank, A. R.},
 journal = {IEEE Communications Magazine issue “Technologies for 3G and Beyond”},
 pages = {pages 136--142},
 tags = {wireless,channel_coding},
 title = {Space-{Time} {Coding} for {Broadband} {Wireless} {Transmission}},
 volume = {vol. 40, no. 9},
 year = {2002}
}



@article{amaudruz_combinatorial_2009,
 abstract = {A long-standing open question in information theory is to characterize the unicast capacity of a wireless relay network. The difficulty arises due to the complex signal interactions induced in the network, since the wireless channel inherently broadcasts the signals and there is interference among transmissions. Recently, Avestimehr, Diggavi and Tse proposed a linear binary deterministic model that takes into account the shared nature of wireless channels, focusing on the signal interactions rather than the background noise. They generalized the min-cut max-flow theorem for graphs to networks of deterministic channels and proved that the capacity can be achieved using information theoretical tools. They showed that the value of the minimum cut is in this case the minimum rank of all the binary adjacency matrices describing source-destination cuts. However, since there exists an exponential number of cuts, identifying the capacity through exhaustive search becomes infeasible. In this work, we develop a polynomial time algorithm that discovers the relay encoding strategy to achieve the min-cut value in binary linear deterministic (wireless) networks, for the case of a unicast connection. Our algorithm crucially uses a notion of linear independence between edges to calculate the capacity in polynomial time. Moreover, we can achieve the capacity by using very simple one-bit processing at the intermediate nodes, thereby constructively yielding finite length strategies that achieve the unicast capacity of the linear deterministic (wireless) relay network.},
 type={4},
 author = {Amaudruz, A. and Fragouli, C.},
 journal = {ACM-SIAM Symposium on Discrete Algorithms (SODA)},
 tags = {wireless},
 title = {Combinatorial algorithms for wireless information flow},
 year = {2009}
}



@inproceedings{appuswamy_relay_2010,
 abstract = {We consider a unicast communication problem where a source transmits information to a destination through a wireless network with the help of k relays positioned on a line. We adopt the linear deterministic model to capture the wireless signal interactions and study the optimal placement of the relays so that the capacity from the source to the destination in the deterministic network is maximized. Analytical results are provided for a number of special cases, and the insights gained are used to provide a heuristic framework for designing large relay networks.},
 type={4},
 author = {Appuswamy, R. and Atsan, Emre and Fragouli, C. and Franceschetti, Massimo},
 booktitle = {{IEEE} {Wireless} {Network} {Coding} {Workshop} ({WiNC})},
 tags = {wireless},
 title = {On relay placement for deterministic line networks},
 year = {2010}
}



@inproceedings{argyraki_creating_2013,
 abstract = {Current security systems often rely on the adversary's computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary's limited network presence (i.e., that the adversary cannot be located at many different points in the network at the same time). We present a system that leverages this opportunity to enable N wireless nodes to create a shared secret S, in a way that an eavesdropper, Eve, obtains very little information on S. Our system consists of two steps: (1) The nodes transmit packets following a special pattern, such that Eve learns very little about a given fraction of the transmitted packets. This is achieved through a combination of beam forming (from many different sources) and wiretap codes. (2) The nodes participate in a protocol that reshuffles the information known to each node, such that the nodes end up sharing a secret that Eve knows very little about. Our protocol is easily implementable in existing wireless devices and scales well with the number of nodes; these properties are achieved through a combination of public feedback, broadcasting, and network coding. We evaluate our system through a 5-node testbed. We demonstrate that a group of wireless nodes can generate thousands of new shared secret bits per second, with their secrecy being independent of the adversary's computational capabilities.},
 type={4},
 author = {Argyraki, K. and Diggavi, Suhas and Duarte Gelvez, Melissa and Fragouli, C. and Gkatzianas, Marios Apostolos and Kostopoulos, Panagiotis},
 booktitle = {Proceedings of the {ACM} {Conference} on {Mobile} {Computing} and {Networking} ({MobiCom})},
 doi = {10.1145/2500423.2500440},
 keywords = {Group secret agreement, Physical-layer security},
 note = {event-place: Miami, Florida, USA},
 tags = {security},
 title = {Creating {Secrets} out of {Erasures}},
 year = {2013}
}



@inproceedings{atsan_low_2013,
 abstract = {We design and evaluate a lightweight encryption protocol suitable for sensor networks, that enables weak security in the presence of passive eavesdroppers. At every communication round, our protocol creates a key between each sensor node and the sink, by appropriately mixing and coding information packets that the nodes passively overhear. Evaluation using the TOSSIM simulator indicates that with our protocol we can gain significant security benefits at low overhead cost.},
 type={4},
 author = {Atsan, Emre and Safaka, I. and Keller, L. and Fragouli, C.},
 booktitle = {Proceedings of the 2013 {IEEE} {International} {Symposium} on {Network} {Coding} ({NetCod})},
 keywords = {information-theoretic security, Sensor networks, Week security},
 note = {event-place: Calgary, Canada},
 tags = {security,sensor_networks},
 title = {Low cost security for sensor networks},
 year = {2013}
}



@inproceedings{atsan_towards_2012,
 abstract = {We present a method to integrate the Quantize-Map-Forward (QMF) relaying scheme into the standard LTE operation, for a two-relay diamond network configuration. Our approach implements QMF using mainly existing LTE modules and functionalities, and results in minimal changes in the standard link-layer LTE operation. In particular, the destination operation is only affected in that we adapt the log-likelihood ratio (LLR) calculations at the decoder input to take into account the existence of relays; thus, the decoding complexity and operations (apart the LLR calculations) are not modified. We report extensive performance evaluations of our scheme using the OpenAirInterface (OAI) link-level simulation tools.},
 type={4},
 author = {Atsan, Emre and Knopp, Raymond and Diggavi, Suhas N. and Fragouli, C.},
 booktitle = {Information {Theory} {Workshop} ({ITW})},
 publisher = {IEEE},
 tags = {wireless},
 title = {Towards integrating {Quantize}-{Map}-{Forward} relaying into {LTE}},
 year = {2012}
}



@article{brahma_complexity_2016,
 type={2},
 author = {Brahma, S. and Ozgur, A. and Fragouli, C.},
 journal = {IEEE Transactions on Information Theory},
 tags = {wireless},
 title = {On the {Complexity} of {Scheduling} in {Half}-{Duplex} {Diamond} {Networks}},
 year = {2016}
}



@inproceedings{brahma_pliable_2012,
 type={4},
 author = {Brahma, S. and Fragouli, C.},
 booktitle = {Information {Theory} {Proceedings} ({ISIT}), 2012 {IEEE} {International} {Symposium} on},
 pages = {2251--2255},
 publisher = {IEEE},
 tags = {network_coding},
 title = {Pliable index coding},
 year = {2012}
}



@inproceedings{brahma_pliable_2013,
 type={4},
 author = {Brahma, S. and Fragouli, C.},
 booktitle = {Proceedings of the {IEEE} {International} {Symposium} on {Infromation} {Theory} ({ISIT})},
 tags = {network_coding},
 title = {Pliable {Index} {Coding} - {The} {Multiple} {Requests} {Case}},
 year = {2013}
}



@article{brahma_pliable_2015,
 type={2},
 author = {Brahma, S. and Fragouli, C.},
 journal = {IEEE Transactions on Information Theory},
 tags = {network_coding},
 title = {Pliable {Index} {Coding}},
 year = {2015}
}



@inproceedings{brahma_quilt_2014,
 type={4},
 author = {Brahma, S. and Sengupta, A. and Duarte Gelvez, Melissa and Fragouli, C. and Diggavi, Suhas},
 booktitle = {{IEEE} {INFOCOM}},
 tags = {wireless},
 title = {{QUILT}: {A} decode/quantize-interleave-transmit approach to cooperative relaying},
 year = {2014}
}



@inproceedings{brahma_simple_2012,
 type={4},
 author = {Brahma, S. and Ozgur, A. and Fragouli, C.},
 booktitle = {Information {Theory} {Proceedings} ({ISIT}), 2012 {IEEE} {International} {Symposium} on},
 pages = {1112--1116},
 publisher = {IEEE},
 tags = {wireless},
 title = {Simple schedules for half-duplex networks},
 year = {2012}
}



@inproceedings{brahma_simple_2014,
 type={4},
 author = {Brahma, S. and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 tags = {wireless},
 title = {A simple relaying strategy for diamond networks},
 year = {2014}
}



@inproceedings{brahma_structure_2013,
 type={4},
 author = {Brahma, S. and Fragouli, C. and Ozgur, A.},
 booktitle = {Proceedings of the {Annual} {Allerton} {Conference} on {Communication}, {Control}, and {Computing}},
 tags = {wireless},
 title = {On the structure of approximately optimal schedules for half-duplex diamond networks},
 year = {2013}
}



@inproceedings{brahma_structure_2014,
 type={4},
 author = {Brahma, S. and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 tags = {wireless},
 title = {Structure of optimal schedules in diamond networks},
 year = {2014}
}



@inproceedings{brahma_switched_2014,
 type={4},
 author = {Brahma, S. and Sengupta, A. and Fragouli, C.},
 booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},
 tags = {wireless},
 title = {Switched local schedules for diamond networks},
 year = {2014}
}



@inproceedings{buyukalp_untrusting_2012,
 type={4},
 author = {Buyukalp, Y. and Maatouk, G. and Prabhakaran, V. M. and Fragouli, C.},
 booktitle = {Network {Coding} ({NetCod}), 2012 {International} {Symposium} on},
 pages = {79--84},
 publisher = {IEEE},
 tags = {network_coding,security},
 title = {Untrusting network coding},
 year = {2012}
}



@inproceedings{cardone_network_2016,
 type={4},
 author = {Cardone, M. and Fragouli, C. and Tuninetti, D.},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 tags = {wireless},
 title = {On {Network} {Simplification} for {Gaussian} {Half}-{Duplex} {Diamond} {Networks}},
 year = {2016}
}



@article{chekuri_achievable_2006,
 abstract = {A non-uniform demand network consists of a source and a set of receivers that have different min-cut values from the source. We look at the case where the receivers would like to receive from the source a rate that is (approximately) equal to their min-cut value. We formulate this problem and its relaxations and present preliminary results.},
 type={4},
 author = {Chekuri, C. and Fragouli, C. and Soljanin, E.},
 journal = {ISIT},
 tags = {network_coding},
 title = {On achievable information rates in single-source non-uniform demand networks},
 year = {2006}
}



@article{chekuri_average_2005,
 abstract = {We analyze a special class of configurations with \$h\$ sources and \$N\$ receivers to demonstrate the throughput benefits of network coding and deterministic code design. We show that the throughput benefits network coding offers can increase proportionally to \${\textbackslash}sqrtN\$, with respect to the average as well as the minimum throughput. We also show that while for this class of configurations there exists a deterministic coding scheme that realizes these benefits using a binary alphabet, randomized coding may require an exponentially large alphabet size.},
 type={4},
 author = {Chekuri, C. and Fragouli, C. and Soljanin, E.},
 journal = {ISIT},
 tags = {network_coding},
 title = {On average throughput benefits and alphabet size in network {Coding}},
 year = {2005}
}



@article{chekuri_average_2006,
 abstract = {We examine the throughput benefits that network coding offers with respect to the average throughput achievable by routing, where the average throughput refers to the average of the rates that the individual receivers experience. We relate these benefits to the integrality gap of a standard LP formulation for the directed Steiner tree problem. We describe families of configurations over which network coding at most doubles the average throughput, and analyze a class of directed graph configurations with \$N\$ receivers where network coding offers benefits proportional to \${\textbackslash}sqrtN\$. We also discuss other throughput measures in networks, and show how in certain classes of networks, the average throughput can be achieved uniformly by all receivers by employing vector routing and channel coding. Finally, we show configurations where use of randomized coding may require an alphabet size exponentially larger than the minimum alphabet size required.},
 type={4},
 author = {Chekuri, C. and Fragouli, C. and Soljanin, E.},
 journal = {IEEE Trans. Inform. Theory},
 tags = {network_coding},
 title = {On {Average} {Throughput} {Benefits} and {Alphabet} {Size} in {Network} {Coding}},
 year = {2006}
}



@inproceedings{czap_broadcasting_2012,
 type={4},
 author = {Czap, L. and Prabhakaran, V. M. and Diggavi, Suhas N. and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 month = {February},
 publisher = {IEEE},
 tags = {security},
 title = {Broadcasting {Private} {Messages} {Securely}},
 year = {2012}
}



@inproceedings{czap_encrypt_2012,
 type={4},
 author = {Czap, L. and Prabhakaran, V. M. and Fragouli, C. and Diggavi, S.},
 booktitle = {In submission},
 tags = {security},
 title = {Encrypt and mix: unconditionally optimal secure wireless broadcast},
 year = {2012}
}



@inproceedings{czap_exploiting_2013,
 type={4},
 author = {Czap, L. and Prabhakaran, V. M. and Diggavi, S. and Fragouli, C.},
 booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},
 tags = {security},
 title = {Exploiting {Common} {Randomness}: a {Resource} for {Network} {Secrecy}},
 year = {2013}
}



@article{czap_lp_2016,
 type={2},
 author = {Czap, L. and Fragouli, C. and Prabhakaran, V. M. and Diggavi, S.},
 journal = {IEEE Transactions on Information Theory},
 tags = {security},
 title = {An {LP} {Characterization} of the {Secret}-message {Capacity} of {Three} {Erasure} {Networks} with {Feedback}},
 year = {2016}
}



@inproceedings{czap_secret_2011,
 type={4},
 author = {Czap, L. and Prabhakaran, V. M. and Fragouli, C. and Diggavi, Suhas N.},
 booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},
 tags = {security},
 title = {Secret message capacity of erasure broadcast channels with feedback},
 year = {2011}
}



@article{czap_secret_2015,
 type={2},
 author = {Czap, L. and Fragouli, C. and Prabhakaran, V. M. and Diggavi, Suhas},
 journal = {IEEE Transactions on Information Theory},
 tags = {security},
 title = {Secret communication over broadcast erasure channels with state-feedback},
 year = {2015}
}



@inproceedings{czap_secure_2011,
 type={4},
 author = {Czap, L. and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} on {Network} {Coding} ({NetCod})},
 month = {July},
 tags = {security},
 title = {On secure key exchange in wireless networks},
 year = {2011}
}



@inproceedings{czap_secure_2013,
 type={4},
 author = {Czap, L. and Fragouli, C. and Prabhakaran, V. M. and Diggavi, Suhas},
 booktitle = {Annual {Allerton} {Conference} on {Communication}, {Control}, and {Computing}},
 tags = {security},
 title = {Secure {Network} {Coding} with {Erasures} and {Feedback}},
 year = {2013}
}



@article{czap_secure_2015,
 type={2},
 author = {Czap, L. and Fragouli, C. and Prabhakaran, V. M. and Diggavi, Suhas},
 journal = {IEEE Transactions on Information Theory},
 tags = {security},
 title = {Secure network coding with erasures and feedback},
 year = {2015}
}



@inproceedings{czap_securing_2013,
 type={4},
 author = {Czap, L. and Prabhakaran, V. M. and Diggavi, S. and Fragouli, C.},
 booktitle = {{IEEE} {Symposium} on {Network} {Coding} ({NetCod})},
 tags = {security},
 title = {Securing {Broadcast} {Against} {Dishonest} {Receivers}},
 year = {2013}
}



@inproceedings{czap_triangle_2014,
 type={4},
 author = {Czap, L. and Prabhakaran, V. M. and Diggavi, Suhas and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 tags = {security},
 title = {Triangle network secrecy},
 year = {2014}
}



@article{dhulipala_silence_2006,
 abstract = {We consider a power-efficient communication model for wireless sensor networks where silence is used to convey information. We study the average-case and worst-case complexities of symmetric functions under this model and describe protocols that achieve them. For binary-input functions, we determine the average complexity. For ternary-input functions, we consider a special type of protocols and provide close lower and upper bounds for their worst-case complexity. We also describe the protocol that achieves the average complexity.},
 type={4},
 author = {Dhulipala, A. and Fragouli, C. and Orlitsky, A.},
 journal = {ISIT},
 tags = {sensor_networks},
 title = {Silence based communication for sensor networks},
 year = {2006}
}



@article{dhulipala_silence_2010,
 abstract = {Communication complexity—the minimum amount of communication required—of computing a function of data held by several parties is studied. A communication model where silence is used to convey information is introduced. For this model the worst-case and average-case complexities of symmetric functions are studied. For binary-input functions the average- and worst-case complexities are determined and the protocols achieving them are described. For functions of non-binary inputs one-round communication, where each party is restricted to communicate in consecutive stages, is considered and the extra amount of communication required by one- over multi-round communication is analyzed. For the special case of ternary-input functions close lower and upper bounds on the worst-case one-round complexity are provided and protocols achieving them are described. Protocols achieving the average-case one-round complexity for ternary-input functions are also described. These protocols can be generalized to inputs of arbitrary size.},
 type={2},
 author = {Dhulipala, A. and Fragouli, C. and Orlitsky, A.},
 journal = {IEEE Transactions on Information Theory},
 tags = {sensor_networks},
 title = {Silence based communication},
 volume = {56},
 year = {2010}
}



@inproceedings{dhulipala_single_2007,
 abstract = {Communication complexity of computing functions using unrestricted communication and one-round communication are compared. In the standard unrestricted communication each party could potentially communicate several times while in one-round communication each party is restricted to communicate at most once. Results on the ratio of these two complexities are provided for symmetric and asymmetric functions under different scenarios. These results are suitably illustrated with examples.},
 type={4},
 author = {Dhulipala, Anand K. and Fragouli, C. and Orlitsky, Alon},
 booktitle = {Information {Theory}, 2007. {ISIT} 2007. {IEEE} {International} {Symposium} on},
 doi = {10.1109/isit.2007.4557296},
 month = {June},
 pages = {636 --640},
 tags = {CC},
 title = {Single versus multiple rounds for distributed function computation},
 year = {2007}
}



@inproceedings{drinea_delay_2009,
 type={4},
 author = {Drinea, Eleni and Fragouli, C. and Keller, L.},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 doi = {10.1109/isit.2009.5205612},
 keywords = {network coding, channel coding, erasure channel, feedback, feedback information, multiple description coding, NP-hard, offline algorithm, offline minimization problem, online algorithm, online heuristics},
 tags = {network_coding,wireless},
 title = {Delay with network coding and feedback},
 year = {2009}
}



@article{drinea_real-time_2012,
 type={4},
 author = {Drinea, Eleni and Keller, L. and Fragouli, C.},
 doi = {10.1016/j.phycom.2012.05.005},
 issn = {1874-4907},
 journal = {Physical Communication},
 keywords = {Delay},
 number = {0},
 tags = {network_coding},
 title = {Real-time delay with network coding and feedback},
 url = {http://www.sciencedirect.com/science/article/pii/S1874490712000444},
 year = {2012}
}



@inproceedings{duarte_gelvez_quantize-map-forward_2013,
 type={4},
 author = {Duarte Gelvez, Melissa and Sengupta, A. and Brahma, S. and Fragouli, C. and Diggavi, S.},
 booktitle = {{ACM} {MOBIHOC}},
 tags = {wireless},
 title = {Quantize-{Map}-{Forward} ({QMF}) {Relaying} - {An} {Experimental} {Study}},
 year = {2013}
}



@inproceedings{durvy_feedback_2007,
 type={4},
 author = {Durvy, M. and Fragouli, C. and Thiran, P.},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 publisher = {IEEE},
 tags = {network_coding},
 title = {On feedback for network coding},
 year = {2007}
}



@article{durvy_towards_2007,
 abstract = {We propose a mechanism for reliable broadcasting in wireless networks, that consists of two components: a method for bandwidth efficient acknowledgment collection, and a coding scheme that uses acknowledgments. Our approach combines ideas from network coding and distributed space time coding.},
 type={4},
 author = {Durvy, M. and Fragouli, C. and Thiran, P.},
 journal = {ISIT},
 tags = {network_coding,wireless},
 title = {Towards reliable broadcasting using {ACKs}},
 year = {2007}
}



@inproceedings{ebrahimi_algebraic_2010,
 type={4},
 author = {Ebrahimi, Javad and Fragouli, C.},
 booktitle = {International conference on {Signal} {Processing} and {Communications} ({SPCOM})},
 tags = {wireless},
 title = {Algebraic techniques for deterministic networks},
 year = {2010}
}



@article{ebrahimi_algorithms_2011,
 abstract = {We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L x L coding matrices that play a similar role as coding coefficients in scalar coding. We start our work by extending the algebraic framework developed for multicasting over graphs in [1] to include operations over matrices; we build on this generalized framework, to provide a new approach for both scalar and vector code design which attempts to minimize the employed field size and employed vector length, while selecting the coding operations. Our algorithms also lead as a special case to network code designs that employ structured matrices.},
 type={2},
 author = {Ebrahimi, Javad and Fragouli, C.},
 journal = {IEEE Transactions on Information Theory (Special Issue on Facets of Coding Theory: from Algorithms to Networks)},
 tags = {network_coding},
 title = {Algorithms for vector network coding},
 year = {2011}
}



@inproceedings{ebrahimi_benefits_2010,
 abstract = {In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L x L coding matrices that play a similar role as coding coefficients in scalar coding. Vector network coding generalizes scalar coding, and thus offers a wider range of solutions over which to optimize. This paper starts exploring the new possibilities vector network coding can offer along two directions. First, we propose a new randomized algorithm for vector network coding. We compare the performance of our proposed algorithm with the existing randomized algorithms in the literature over a specific class of networks. Second, we explore the use of structured coding matrices for vector network coding. We present deterministic designs that allow to operate using rotation coding matrices and thus result in reduced encoding complexity.},
 type={4},
 author = {Ebrahimi, Javad and Fragouli, C.},
 booktitle = {48th {Annual} {Allerton} {Conference} on {Communication}, {Control}, and {Computing}},
 tags = {network_coding},
 title = {On the benefits of vector network coding},
 year = {2010}
}



@article{ebrahimi_combinatorial_2011,
 abstract = {A long-standing open question in information theory is to characterize the unicast capacity of a wireless relay network. The difficulty arises due to the complex signal interactions induced in the network, since the wireless channel inherently broadcasts the signals and there is interference among transmissions. Recently, Avestimehr, Diggavi and Tse proposed a linear deterministic model that takes into account the shared nature of wireless channels, focusing on the signal interactions rather than the background noise. They generalized the min-cut max-flow theorem for graphs to networks of deterministic channels and proved that the capacity can be achieved using information theoretical tools. They showed that the value of the minimum cut is in this case the minimum rank of all the adjacency matrices describing source-destination cuts. In this paper, we develop a polynomial time algorithm that discovers the relay encoding strategy to achieve the min-cut value in linear deterministic (wireless) networks, for the case of a unicast connection. Our algorithm crucially uses a notion of linear independence between channels to calculate the capacity in polynomial time. Moreover, we can achieve the capacity by using very simple one-symbol processing at the intermediate nodes, thereby constructively yielding finite length strategies that achieve the unicast capacity of the linear deterministic (wireless) relay network.},
 type={2},
 author = {Ebrahimi, Javad and Fragouli, C.},
 journal = {ACM Transactions on Algorithms},
 tags = {network_coding,wireless},
 title = {Combinatorial algorithms for wireless information flow},
 year = {2011}
}



@inproceedings{ebrahimi_multicasting_2010,
 abstract = {We present a polynomial time algorithm for multicasting rate h to N receivers over deterministic networks. Our algorithm requires intermediate network nodes to perform coding operations over vectors of a finite length L, through multiplication with L \#x00D7; L binary coding matrices that play the same role as coding coefficients over graphs. Our code design consists in selecting these matrices so that each receiver is able to recover the source information. As a special case, we provide an alternative construction for a unicast algorithm over deterministic networks.},
 type={4},
 author = {Ebrahimi, Javad and Fragouli, C.},
 booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},
 doi = {10.1109/itwksps.2010.5503221},
 month = {January},
 tags = {wireless},
 title = {Multicasting algorithms for deterministic networks},
 year = {2010}
}



@inproceedings{ebrahimi_properties_2012,
 type={4},
 author = {Ebrahimi, J. B. and Fragouli, C.},
 booktitle = {Information {Theory} {Proceedings} ({ISIT}), 2012 {IEEE} {International} {Symposium} on},
 pages = {1306--1310},
 publisher = {IEEE},
 tags = {network_coding},
 title = {Properties of network polynomials},
 year = {2012}
}



@inproceedings{ebrahimi_vector_2010,
 abstract = {We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L x L coding matrices that play a similar role as coding coefficients in scalar coding. Our algorithms for scalar network jointly optimize the employed field size while selecting the coding coefficients. Similarly, for vector coding, our algorithms optimize the length L while designing the coding matrices. These algorithms apply both for regular network graphs as well as linear deterministic networks.},
 type={4},
 author = {Ebrahimi, Javad and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 doi = {10.1109/isit.2010.5513771},
 keywords = {algebraic algorithms, coding coefficients, coding matrices, intermediate node process, linear deterministic networks, matrix algebra, network coding, network graphs, network theory (graphs), scalar network coding, source multicast information, vector network coding algorithms},
 tags = {network_coding},
 title = {Vector network coding},
 year = {2010}
}



@article{ezzeldin_approximate_2020,
 type={2},
 author = {Ezzeldin, Y. H. and Cardone, M. and Fragouli, C. and Tuninetti, D.},
 journal = {IEEE Transactions on Information Theory},
 tags = {wireless},
 title = {The {Approximate} {Capacity} of {Half}-{Duplex} {Line} {Networks}},
 year = {2020}
}



@inproceedings{ezzeldin_efficiently_2017,
 type={4},
 author = {Ezzeldin, Y. H. and Cardone, M. and Fragouli, C. and Tuninetti, D.},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 tags = {wireless},
 title = {Efficiently {Finding} {Simple} {Schedules} in {Gaussian} {Half}-{Duplex} {Relay} {Line} {Networks}},
 year = {2017}
}



@inproceedings{ezzeldin_gaussian_2018,
 type={4},
 author = {Ezzeldin, Y. H. and Cardone, M. and Fragouli, C. and Caire, Giuseppe},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 tags = {wireless},
 title = {Gaussian 1-2-1 {Networks}: {Capacity} {Results} for {mmWave} {Communications}},
 year = {2018}
}



@inproceedings{ezzeldin_half-duplex_2017,
 type={4},
 author = {Ezzeldin, Y. H. and Cardone, M. and Fragouli, C. and Tuninetti, D.},
 booktitle = {Annual {Allerton} {Conference} on {Communication}, {Control} and {Computing} ({Allerton})},
 tags = {wireless},
 title = {Half-{Duplex} {Routing} is {NP}-hard},
 year = {2017}
}



@article{ezzeldin_multicast_2019,
 type={4},
 author = {Ezzeldin, Y. H. and Cardone, M. and Fragouli, C. and Caire, Giuseppe},
 journal = {IEEE International Symposium of Information Theory (ISIT)},
 tags = {wireless},
 title = {On the {Multicast} {Capacity} of {Full}-{Duplex} 1-2-1 {Networks}},
 year = {2019}
}



@article{ezzeldin_network_2019,
 type={2},
 author = {Ezzeldin, Y. H. and Cardone, M. and Fragouli, C. and Tuninetti, D.},
 journal = {IEEE Transactions on Information Theory},
 tags = {wireless},
 title = {Network {Simplification}: {Building} on {Submodularity}},
 year = {2019}
}



@article{ezzeldin_polynomial-time_2019,
 type={4},
 author = {Ezzeldin, Y. H. and Cardone, M. and Fragouli, C. and Caire, Giuseppe},
 journal = {IEEE International Symposium of Information Theory (ISIT)},
 tags = {wireless},
 title = {Polynomial-time {Capacity} {Calculation} and {Scheduling} for {Half}-{Duplex} 1-2-1 {Network}},
 year = {2019}
}




@inproceedings{ezzeldin_wireless_2016,
 type={4},
 author = {Ezzeldin, Y. H. and Sengupta, A. and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 tags = {wireless},
 title = {Wireless {Network} {Simplification}: {Beyond} {Diamond} {Networks}},
 year = {2016}
}



@article{ezzeldin_wireless_2020,
 type={2},
 author = {Ezzeldin, Y. H. and Sengupta, A. and Fragouli, C.},
 journal = {IEEE Transactions on Information Theory},
 tags = {wireless},
 title = {Wireless {Network} {Simplification}: {The} {Performance} of {Routing}},
 year = {2020}
}



@article{fragouli_average_2004,
 abstract = {We calculate the average throughput benefit that network coding can offer as compared to routing for different classes of multicast configurations over directed graphs. The averaging is over the throughput each individual receiver experiences. For the cases we examine, network coding at most doubles the average throughput.},
 type={4},
 author = {Fragouli, C. and Soljanin, E.},
 journal = {Allerton},
 tags = {network_coding},
 title = {On {Average} {Throughput} {Benefits} for {Network} {Coding}},
 year = {2004}
}



@article{fragouli_benefits_2006,
 abstract = {We argue that the main benefits of network coding in a wireless environment might manifest in situations where the topology dynamically changes, and operation is restricted to distributed algorithms that do not employ knowledge about the network environment. We consider several problem instances in this set-up, that include broadcasting information to all nodes of the network and collecting sensor measurements. We show that in many such cases, under some simplifying assumptions, the problem is theoretically equivalent to simple variations of the coupon collector problem. Thus network coding can offer benefits of a factor of \${\textbackslash}log n\$, where \$n\$ is the number of nodes and the benefits are in terms of energy efficiency, as was proven in the literature. We present simulation results under more realistic conditions that support this claim.},
 type={4},
 author = {Fragouli, C. and Widmer, J. and Le Boudec, J.-Y.},
 journal = {2nd Network Coding Workshop},
 tags = {network_coding,wireless},
 title = {On the benefits of network coding for wireless applications},
 year = {2006}
}



@article{fragouli_bit_2001,
 abstract = {This paper compares bit versus symbol interleaving for parallel-concatenated trellis-coded turbo codes, employing the turbo encoder structure proposed in Benedetto et al., (1996). To compare systems optimized with the same techniques, the paper extends the turbo-encoder design procedure proposed in Fragouli et al. (2001), to bit-interleaved systems. We discuss a method to jointly design the multiple required interleavers for the bit-interleaved system, and a procedure to select constituent encoders that can take advantage of the interleaver structure to achieve a low error floor. Simulation results for the designed bit-interleaved system show better performance than bit-interleaved performance reported in the literature. The symbol-interleaved system though achieves an earlier convergence, especially with an increased number of decoder iterations, but at the cost of a slightly higher error floor.},
 type={4},
 author = {Fragouli, C. and Wesel, R. D.},
 journal = {GlobeCom},
 pages = {pages 931--935},
 tags = {channel_coding},
 title = {Bit vs. {Symbol} {Interleaving} for {Parallel} {Concatenated} {Trellis} {Coded} {Modulation}},
 volume = {vol. 2},
 year = {2001}
}



@article{fragouli_conditions_2005,
 abstract = {In this paper we propose a set of necessary and sufficient conditions under which the throughput in an ad-hoc network can remain constant as the number of nodes \$n\$ increases. Throughput refers to the minimum achievable rate between a source-destination pair for a given routing mechanism and physical model, when the network is shared by \${\textbackslash}Theta(n)\$ randomly chosen source-destination pairs. The main idea is to use a {\textbackslash}em connectivity graph, that does not represent the actual physical network, but rather the available communication resources. This graph also allows to translate the problem of maximizing t he throughput in ad-hoc networks to the multicommodity flow problem and directly apply related results.},
 type={2},
 author = {Fragouli, C. and Tabet, T.},
 journal = {ACM Transactions on Sensor Networks},
 pages = {359--379},
 tags = {sensor_networks},
 title = {Conditions for constant throughput in wireless networks},
 volume = {2},
 year = {2005}
}



@article{fragouli_connection_2004,
 abstract = {The min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by liner re-encoding at nodes in communications networks, the min-cut rate can be also achieved in multicasting to several sinks. In this paper we discuss connections between such coding schemes and convolutional codes. We propose a method to simplify the convolutionalencoder design that is based on a subtree decompositionof the network line graph, describe the structure of the associated matrices, investigate methods to reduce decoding complexity and discuss possible binary implementation.},
 type={4},
 author = {Fragouli, C. and Soljanin, E.},
 journal = {ICC},
 tags = {network_coding},
 title = {A {Connection} between {Network} {Coding} and {Convolutional} {Codes}},
 year = {2004}
}



@article{fragouli_convolutional_1999,
 type={4},
 author = {Fragouli, C. and Wesel, R. D.},
 journal = {Proceedings of the 7th International Conference on Advances in Communications and Control, June 28-July 2, Athens, Greece.},
 tags = {channel_coding},
 title = {Convolutional codes and matrix control theory},
 year = {1999}
}



@article{fragouli_decentralized_2004,
 abstract = {This paper proposes deterministic algorithms for decentralized network coding. Decentralized coding allows to locally specify the coding operations at network nodes without knowledge of the overall network topology, and to accommodate future changes in the network such as addition of receivers. To the best of our knowledge, these are the first deterministic decentralized algorithms proposed for network coding.},
 type={4},
 author = {Fragouli, C. and Soljanin, E.},
 journal = {Information Theory Workshop},
 tags = {network_coding},
 title = {Decentralized {Network} {Coding}},
 year = {2004}
}



@article{fragouli_effect_2002,
 abstract = {The determinant and rank criteria used for space-time code design apply at high SNR. Code design metrics developed for low SNR assume a channel autocorrelation matrix with equal eigenvalues, which does not hold in many practical scenarios. This paper shows that a space-time code designed to ensure full diversity at high SNR can suffer significant degradation when implemented at low-to-medium SNR because of the channel autocorrelation profile. We examine the effect of the channel autocorrelation matrix on a space-time code's performance and discuss how knowledge of this matrix can be used for code design, particularly from the aspect of space-time trellis code minimum memory requirements. Our discussion applies to both flat-fading and frequency-selective channels that are treated in a unified manner.},
 type={4},
 author = {Fragouli, C. and Al-Dhahir, N. and Turin, W.},
 journal = {ICC 2002, NY},
 pages = {pages 826--830},
 tags = {wireless,channel_coding},
 title = {Effect of {Spatio}-{Temporal} {Channel} {Correlation} on the {Performance} of {Space}-{Time} {Codes}},
 volume = {vol. 2},
 year = {2002}
}



@article{fragouli_efficient_2008,
 abstract = {We consider the problem of broadcasting in an ad hoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless networks since it directly affects battery life and thus network lifetime. We prove that applying ideas from network coding allows to realize significant benefits in terms of energy efficiency for the problem of broadcasting, and propose very simple algorithms that allow to realize these benefits in practice. In particular, our theoretical analysis shows that network coding improves performance by a constant factor in fixed networks. We calculate this factor exactly for some canonical configurations. We then show that in networks where the topology dynamically changes, for example due to mobility, and where operations are restricted to simple distributed algorithms, network coding can offer improvements of a factor of , where is the number of nodes in the network. We use the insights gained from the theoretical analysis to propose low-complexity distributed algorithms for realistic wireless ad hoc scenarios, discuss a number of practical considerations, and evaluate our algorithms through packet level simulation.},
 type={2},
 author = {Fragouli, C. and Widmer, J. and Le Boudec, J.-Y.},
 journal = {IEEE/ACM Transactions on Networking},
 pages = {450--463},
 tags = {network_coding,wireless},
 title = {Efficient broadcasting using network coding},
 volume = {16},
 year = {2008}
}



@inproceedings{fragouli_feedback_2007,
 type={4},
 author = {Fragouli, C. and Lun, Desmond and Médard, Muriel and Pakzad, Payam},
 booktitle = {in {Proc}. of 2007 {Conference} on {Information} {Sciences} and {Systems} ({CISS})},
 tags = {network_coding},
 title = {On feedback for network coding},
 year = {2007}
}



@article{fragouli_finite-alphabet_2002,
 abstract = {We propose a method to identify training sequences for multiple-antenna transmissions over quasi-static frequency-selective channels. These sequences are constructed to belong to a standard constant-amplitude 2m-PSK constellation (such as BPSK, QPSK etc) to simplify the transmitter/receiver implementation. Many practical systems use training of predetermined length. Optimal sequences do not exist for all training sequence lengths and constellation alphabets. The proposed method allows us to identify training sequences that belong to a standard constellation for an arbitrary training sequence length and an arbitrary number of unknown channel taps. Performance bounds derived indicate that these sequences achieve near-optimum performance.},
 type={4},
 author = {Fragouli, C. and Al-Dhahir, N. and Turin, W.},
 journal = {ICC 2002, NY},
 pages = {pages 6--10},
 tags = {wireless,channel_coding},
 title = {Finite-{Alphabet} {Constant}-{Amplitude} {Training} {Sequences} for {Multiple}-{Antennas}},
 volume = {vol. 25, no. 1},
 year = {2002}
}



@article{fragouli_information_2006,
 abstract = {The famous min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by linear re-encoding at nodes in communications networks, the min-cut rate can be also achieved in multicasting to several sinks. Constructing such coding schemes efficiently is the subject of current research. The main idea in this paper is the identification of structural properties of multicast configurations, by decompositing the information flows into a minimal number of subtrees. This decomposition allows us to show that very different networks are equivalent from the coding point of view, and offers a method to identify such equivalence classes. It also allows us to divide the network coding problem into two almost independent problems: one of graph theory and the other of classical channel coding theory. This approach to network coding enables us to derive tight bounds on the network code alphabet size and calculate the throughput improvement network coding can offer for different configurations. But perhaps the most significant strength of our approach concerns future network coding practice. Namely, we propose algorithms to specify the coding operations at network nodes without the knowledge of the overall network topology. Such decentralized designs facilitate the construction of codes which can easily accommodate future changes in the network, e.g., addition of receivers and loss of links.},
 type={4},
 author = {Fragouli, C. and Soljanin, E.},
 journal = {IEEE Trans. Inform. Theory},
 tags = {network_coding},
 title = {Information {Flow} {Decomposition} for {Network} {Coding}},
 year = {2006}
}



@article{fragouli_minimality_2001,
 abstract = {This paper investigates encoders optimization for the Hamming weight after periodic puncturing, and discusses minimality issues that may affect the performance of the punctured encoders. Periodically puncturing a minimal encoder produces a higher rate encoder that may or may not be minimal. If it is not minimal, it may have a zero-output loop and it may be catastrophic. A code search can use a fast algorithm to determine whether an encoder's state diagram has a zero-output loop under periodic symbol puncturing, and a proposed method to assess the performance of codes with a zero-output loop that are not catastrophic. As an example, the paper optimizes rate-1/4 unpunctured codes for Hamming weight under both bit-wise and symbol-wise periodic puncturing. Code tables and simulation results are included.},
 type={4},
 author = {Fragouli, C. and Komninakis, C. and Wesel, R. D.},
 journal = {ICC 2001, Helsinki, Finland, June},
 pages = {pages 300--304},
 tags = {channel_coding},
 title = {Minimality for puncturing convolutional codes},
 volume = {vol. 1},
 year = {2001}
}



@incollection{fragouli_multipath_2009,
 abstract = {Balancing energy efficiency and reliability is a common underlying goal for most information collection protocols in sensor networks. Multipath diversity has emerged as one of the promising techniques to achieve such a balance. In this chapter, we provide a unified framework for the multipath techniques in the literature and discuss their basic benefits and drawbacks. We also discuss emerging techniques from the area of network coding.},
 type={4},
 author = {Fragouli, C. and Argyraki, K. and Keller, L.},
 booktitle = {Sensor {Networks}},
 pages = {75--99},
 publisher = {Springer},
 tags = {sensor_networks},
 title = {Multipath {Diversity} and {Robustness} for {Sensor} {Networks}},
 year = {2009}
}



@article{fragouli_network_2004,
 abstract = {We consider a multicast configuration with two sources, and translate the network code design problem to vertex coloring of an appropriately defined graph. This observation enables to derive code design algorithms and alphabet size bounds, as well as establish a connection with a number of well-known results from discrete mathematics that increase our insight in the different trade-offs possible for network coding.},
 type={4},
 author = {Fragouli, C. and Soljanin, E. and Shokrollahi, A.},
 journal = {CISS},
 tags = {network_coding},
 title = {Network {Coding} as a {Coloring} {Problem}},
 year = {2004}
}



@article{fragouli_network_2005,
 abstract = {Network Monitoring is a challenging problem that has received a lot of attention in the Internet community, particularly in the context of overlay networks. Independently, recent advances in Network Coding have shown that it is possible to increase network capacity and better share the available resources by allowing intermediate nodes to perform processing operations, in addition to just forwarding packets. In this work, we propose the use of Network Coding techniques to improve Network Monitoring. As a specific application, we use our approach for the well-known problem of network tomography, and in particular for inferring link loss rates from end-to-end measurements. We demonstrate that our approach can decrease the bandwidth used by probes, improve the accuracy of estimation, and decrease the complexity of selecting paths or trees to send probes. Overall, we argue that the use of Network Coding techniques shows great promise for improving several aspects of monitoring in overlay networks.},
 type={4},
 author = {Fragouli, C. and Markopoulou, Athina},
 journal = {Allerton},
 tags = {network_coding},
 title = {A {Network} {Coding} {Approach} to {Network} {Monitoring}},
 year = {2005}
}



@article{fragouli_network_2006,
 abstract = {We show that network coding allows to realize significant energy savings in a wireless ad-hoc network, when each node of the network is a source that wants to transmit information to all other nodes. Energy efficiency directly affects battery life and thus is a critical design parameter for wireless ad-hoc networks. We propose an implementable method for performing network coding in such a setting. We analyze theoretical cases in detail, and use the insights gained to propose a practical, fully distributed method for realistic wireless ad-hoc scenarios. We address practical issues such as setting the forwarding factor, managing generations, and impact of transmission range. We use theoretical analysis and packet level simulation.},
 type={4},
 author = {Fragouli, C. and Widmer, J. and Le Boudec, J.-Y.},
 journal = {Infocom},
 tags = {network_coding,wireless},
 title = {A {Network} {Coding} {Approach} to {Energy} {Efficient} {Broadcasting}: from {Theory} to {Practice}},
 year = {2006}
}



@article{fragouli_network_2006-1,
 abstract = {Network coding is a new research area that may have interesting applications in practical networking systems. With network coding, intermediate nodes may send out packets that are linear combinations of previously received information. There are two main benefits of this approach: potential throughput improvements and a high degree of robustness. Robustness translates into loss resilience and facilitates the design of simple distributed algorithms that perform well, even if decisions are based only on partial information. This paper is an instant primer on network coding: we explain what network coding does and how it does it. We also discuss the implications of theoretical results on network coding for realistic settings and show how network coding can be used in practice.},
 type={5},
 author = {Fragouli, C. and Widmer, J. and Le Boudec, J.-Y.},
 journal = {ACM SIGCOM Computer Communication Review},
 tags = {network_coding},
 title = {Network coding: an instant primer},
 year = {2006}
}



@article{fragouli_network_2007,
 abstract = {End-to-end active network monitoring infers network characteristics by sending and collecting probe packets from the network edge, while probes traverse the network through multicast trees or a mesh of unicast paths. Most reported methods consider given source and receiver locations and study the path selection and the associated estimation algorithms. In this paper, we show that appropriately choosing the number of sources and receivers, as well as their location, may have a significant effect on the accuracy of the estimation; we also give guidelines on how to choose the best “points of view” of a network for link loss monitoring purposes. Though this observation applies across all monitoring methods, we consider, in particular, networks where nodes are equipped with network coding capabilities; our framework includes as special cases the scenarios of pure multicast and network coding. We show that, in network-coding enabled networks, multiple source active monitoring can exploit these capabilities to estimate link loss rates more efficiently than purely tomographic methods. To address the complexity of the estimation problem for large networks, we also propose efficient algorithms, including the decomposition into smaller multicast inference problems, belief-propagation, and a MINC-like algorithm.},
 type={4},
 author = {Fragouli, C. and Markopoulou, Athina and Srinivasan, R. and Diggavi, Suhas N.},
 journal = {ITA},
 tags = {network_coding},
 title = {Network monitoring: it depends on your points of view},
 year = {2007}
}



@book{fragouli_network_2007-1,
 type={5},
 author = {Fragouli, C. and Soljanin, E.},
 publisher = {Now Publisher},
 series = {Foundations and {Trends} in {Networking}},
 tags = {network_coding},
 title = {Network coding: {Fundamentals} and {Applications}},
 volume = {1},
 year = {2007}
}



@article{fragouli_network_2008,
 abstract = {We here advocate the case for network coding as a guiding paradigm for the operation of networks that vary in a small time frame, due to node mobility, channel variations, and varying traffic conditions. Three ideas that appeared succesively in time brought in place an elegant operation for network coding in such environments. These are, use of randomized network coding for intermediate node operation, use of generations to avoid synchronization, and use of subspace coding to allow for small packet sizes. Information theoretical performance limits support these results.},
 type={4},
 author = {Fragouli, C.},
 journal = {IEEE International Wireless Communications and Mobile Computing Conference},
 tags = {network_coding,wireless},
 title = {Network coding for dynamically changing networks},
 year = {2008}
}



@article{fragouli_network_2009,
 type={2},
 author = {Fragouli, C. and Markopoulou, Athina and Gjoka, M.},
 journal = {IEEE Transactions on Information Theory},
 month = {January},
 tags = {wireless},
 title = {A network coding approach to network tomography},
 year = {2009}
}



@article{fragouli_network_2011,
 type={2},
 author = {Fragouli, C.},
 journal = {Special Issue on Network Coding at the Proceedings of the IEEE},
 tags = {network_coding},
 title = {Network coding: beyond throughput benefits},
 year = {2011}
}



@article{fragouli_overview_2009,
 type={4},
 author = {Fragouli, C.},
 doi = {10.1504/ijaacs.2009.024280},
 issn = {1754-8632},
 journal = {Int. J. Auton. Adapt. Commun. Syst.},
 note = {Place: Inderscience Publishers, Geneva, SWITZERLAND
Publisher: Inderscience Publishers},
 number = {1},
 pages = {1--23},
 tags = {network_coding,wireless},
 title = {An overview of network coding for dynamically changing networks},
 volume = {2},
 year = {2009}
}



@article{fragouli_prefiltered_2001,
 abstract = {This paper addresses the problem of soft equalization for time-variant frequency-selective channels. Such a channel arises in EDGE (Enhanced Data for GSM Evolution), third generation TDMA proposal, which employs 8-PSK modulation with a linearized GMSK pulse shaping filter that introduces strong intersymbol interference. The proposed equalization approach uses a prefilter to concetrate the effective channel power in a small number of taps, followed by a reduced complexity MAP equalizer to produce soft decision outputs. The MAP equalizer is based on the implementation of the M-algorithm in the log domain. The prefilter introduces residual intersymbol interference which degrades the performance of MAP when applied to the trellis of the shortened channel. However, the shape of the overall shortened channel impulse response allows the M-algorithm to approximate the prefiltered MAP performance with a small number of states. Based on this general framework, we investigate several enhancements, such as using a different prefilter for the forward and backward recursion, concatenating two trellis steps during decoding, and temporal oversampling. The performance is evaluated through simulations over the typical urban (TU) EDGE channel.},
 type={4},
 author = {Fragouli, C. and Al-Dhahir, N. and Diggavi, Suhas N. and Turin, W.},
 journal = {CISS},
 tags = {channel_coding},
 title = {Prefiltered space-{Time} {M}-{BCJR} {Equalizer} for {MIMO} {Frequency}-{Selective} {Channels}},
 year = {2001}
}



@article{fragouli_prefiltered_2002,
 abstract = {This paper addresses the problem of soft equalization for space-time-coded transmissions over frequency-selective fading channels. The structure of the space-time code is embedded in the channel impulse response for efficient joint equalization and decoding. The proposed equalization/decoding approach uses a prefilter to concentrate the effective channel power in a small number of taps followed by a reduced-complexity maximum a posteriori probability (MAP) equalizer/decoder to produce soft decisions. The prefilter introduces residual intersymbol interference which degrades the performance of MAP when applied to the trellis of the shortened channel. However, the shape of the overall shortened channel impulse response allows the M-algorithm to approximate the prefiltered MAP performance with a small number of states. Based on this general framework, we investigate several enhancements such as using different prefilters for the forward and backward recursions, concatenating two trellis steps during decoding, and temporal oversampling. The performance is evaluated through simulations over the EDGE typical urban channel.},
 type={2},
 author = {Fragouli, C. and Al-Dhahir, N. and Diggavi, Suhas N. and Turin, W.},
 journal = {IEEE Transactions on Communications},
 pages = {pages 742--753},
 tags = {wireless,channel_coding},
 title = {Prefiltered {M}-{BCJR} {Equalizer} for {MIMO} {Frequency}-{Selective} {Channels}},
 volume = {vol. 50, no. 5},
 year = {2002}
}



@article{fragouli_reduced-complexity_2002,
 abstract = {This paper addresses the problem of training sequence design for multiple-antenna transmissions over quasi-static frequency-selective channels. As performance metric for channel estimation, mean square error is adopted. To achieve the minimum mean square error, the training sequences transmitted from the multiple antennas must have impulse-like auto-correlation and zero cross-correlation. We reduce the problem of designing multiple training sequences to the much easier and well-understood problem of designing a single training sequence with impulse-like auto-correlation. To this end, we propose to encode the training sequences with a space-time code, that may be the same or different from the space-time code that encodes the information symbols. Designing one instead of multiple training sequences reduces the search space significantly and simplifies the construction of optimal or suboptimal training sequences.},
 type={4},
 author = {Fragouli, C. and Al-Dhahir, N. and Turin, W.},
 journal = {WCNC 2002},
 pages = {78--83},
 tags = {wireless,channel_coding},
 title = {Reduced-{Complexity} {Training} {Schemes} for {Multiple}-{Antenna} {Broadband} {Transmissions}},
 volume = {vol. 3},
 year = {2002}
}



@article{fragouli_reduced-trellis_2001,
 type={2},
 author = {Fragouli, C. and Seshadri, N. and Turin, W.},
 journal = {Journal on Wireless Communications and Mobile Computing},
 pages = {pages 397--406},
 tags = {channel_coding},
 title = {Reduced-trellis equalization using a variation of the {M}-{BCJR} algorithm},
 volume = {vol. 1},
 year = {2001}
}



@inproceedings{fragouli_reduced_2000,
 abstract = {The complexity of channel equalization using the BCJR algorithn [1] grows exponentially with the channel memory. The M-BCJR algorithm [2], provides a method for reduced-trellis channel equalization. This paper examines the algorithm performance for different finite impulse response channels, identifies pathological cases, and introduces designer choices such as the decision delay, maximum and minimum phase transformation, and selection of states used by the algorithm. Simulation results demonstrate the effect of the different parameters in the algorithm's performance.},
 type={4},
 author = {Fragouli, C. and Seshadri, N. and Turin, W.},
 booktitle = {{CISS}},
 month = {March},
 note = {event-place: Boston},
 pages = {1159--1163},
 tags = {wireless,channel_coding},
 title = {On reduced trellis equalization using the {M}-{BCJR} {Algorithm}},
 volume = {2},
 year = {2000}
}



@article{fragouli_secure_2015,
 type={4},
 author = {Fragouli, C. and Soljanin, E.},
 journal = {Designs, Codes and Cryptography, Springer Verlag},
 tags = {security},
 title = {({Secure}) {Linear} network coding multicast {A} theoretical minimum and some open problems},
 year = {2015}
}



@article{fragouli_semi-random_1999,
 abstract = {A spread interleaver of length N is a semi-random interleaver based on the random selection without replacement of N integers from 1 to N under a design constraint. This paper extends the spread-interleaver design method to multiple error events, based on the interleaver's role in overall turbo code error event distances. The extension helps to explain why the spread interleaver is specifically designed to be semi-random. Simulation results show the performance achieved for a symbol-interleaved parallel concatenated trellis coded modulation (PCTCM) scheme.},
 type={4},
 author = {Fragouli, C. and Wesel, R. D.},
 journal = {Communication Theory Symposium at Globecom 99, Rio de Janeiro, Brazil, December 5-9},
 pages = {pages 2352--2356},
 tags = {channel_coding},
 title = {Semi-random interleaver design criteria},
 volume = {5},
 year = {1999}
}



@article{fragouli_serially_2002,
 abstract = {Satellite-UMTS supports broadcast applications that involve transmission of the same encoded data over channels that may vary significantly. The same code must allow a user with a good channel to recover the information with low complexity, while a user with a bad channel should still be able to achieve an acceptable BER at the cost of increased complexity and/or decoding delay. To this end, we propose serially concatenated multilevel code structures that employ PSK modulation. The receiver has the flexibility to achieve turbo-code, trellis-code or uncoded performance, depending on the decoding effort. Design considerations include the constituent encoder design and the use of a non-uniform constellation. Simulation results investigate the system's performance and highlight different parameters trade-offs.},
 type={4},
 author = {Fragouli, C. and Polydoros, A.},
 journal = {IEEE Seventh International Symposium on Spread Spectrum Techniques and Applications},
 pages = {pages 697--701},
 tags = {wireless,channel_coding},
 title = {Serially concatenated coding for broadcasting {S}-{UMTS} applications},
 volume = {vol. 3},
 year = {2002}
}



@inproceedings{fragouli_silence_2005,
 type={4},
 author = {Fragouli, C. and Orlitsky, A.},
 booktitle = {43rd {Annual} {Allerton} {Conference} on {Communication}, {Control}, and {Computing}},
 note = {event-place: University of Illinois, Urbana-Champaign, USA},
 tags = {sensor_networks},
 title = {Silence is golden and time is money: power-aware communication for sensor networks},
 year = {2005}
}



@article{fragouli_subtree_2004,
 abstract = {We propose a subtree decomposition method for network coding. This approach enables derivation of tight bounds on the network code alpha- bet size, makes connections with convolutional codes transparent, allows specification of coding operations at network nodes without the knowledge of the overall network topology, and facilitates design of codes which can easily accommodate future changes in the network, such as addition of receivers and loss of links.},
 type={4},
 author = {Fragouli, C. and Soljanin, E.},
 journal = {ISIT},
 tags = {network_coding},
 title = {Subtree {Decomposition} for {Network} {Coding}},
 year = {2004}
}



@article{fragouli_symbol-interleaved_2002,
 type={4},
 author = {Fragouli, C. and Polydoros, A.},
 journal = {CISS 2002},
 tags = {channel_coding},
 title = {Symbol-{Interleaved} {Serially} {Concatenated} {Turbo} {Codes}},
 year = {2002}
}



@article{fragouli_symbol_1999,
 abstract = {This paper presents a method for efficient coding at high spectral efficiency using parallel concatenated trellis coded modulation (PCTCM) with symbol interleaving. The constituent encoders are optimized for symbol-wise free distance, and each has an infinite symbol-wise impulse response. In many cases of practical interest, the optimal structure for these constituent encoders connects the memory elements in a single row. Simulation results show that the performance is as close as 0.5 dB to the constrained capacity.},
 type={4},
 author = {Fragouli, C. and Wesel, R. D.},
 journal = {Communication Theory Miniconference in conjunction with ICC '99, June 6-10 1999},
 pages = {pages 42 -- 46},
 tags = {channel_coding},
 title = {Symbol interleaved parallel concatenated trellis coded modulation},
 year = {1999}
}



@inproceedings{fragouli_throughput_2004,
 abstract = {In this paper we propose a set of necessary and sufficient conditions under which the throughput in an ad-hoc network can remain constant as the number of nodes n increases. Throughput refers to the minimum achievable rate between a source-destination pair for a given routing mechanism and physical model, when the network is shared by {\textbackslash}Theta(n) randomly chosen source-destination pairs. The main idea is to use a connectivity graph, that does not represent the actual physical network, but rather the available communication resources.},
 type={4},
 author = {Fragouli, C. and Tabet, T. and Derdiyok, C.},
 booktitle = {42nd {Annual} {Allerton} {Conference} on {Communication}, {Control}, and {Computing}},
 note = {event-place: University of Illinois, Urbana-Champaign, USA},
 tags = {wireless},
 title = {On the {Throughput} of {Ad}-{Hoc} {Networks} using {Connectivity} {Graphs}},
 year = {2004}
}



@article{fragouli_topology_2006,
 abstract = {The network coding paradigm is based on the idea that independent information flows can be linearly combined throughout the network to give benefits in terms of throughput, complexity etc. In this paper, we explore the application of the network coding paradigm to topology inference. Our goal is to infer the topology of a network using multiple sources and observations at the edges of the network. In particular, we consider networks where multiple sources send probes and intermediate nodes locally combine probe packets (perform XOR-operations in incoming links). In previous works (e.g., Ratnasamy \&amp; McCanne '99; Duffield et al '02), the correlation between the observed packet loss patterns is used to infer the underlying topology. In contrast, our main idea behind using network coding is to introduce correlations among multiple probe packets in a topology dependent manner and also develop algorithms that take advantage of these correlations to infer the network topology from end-host observations. Preliminary numerical results illustrate the performance benefits of this approach. In particular, in the absence of packet loss, we can deterministically infer the topology, with very few probes; in the presence of packet loss, we can rapidly infer topology, even at very small loss rates (which was not the case in previous tomography techniques).},
 type={4},
 author = {Fragouli, C. and Markopoulou, Athina and Diggavi, Suhas N.},
 journal = {Allerton},
 tags = {network_coding},
 title = {Topology inference using network coding},
 year = {2006}
}



@article{fragouli_training-based_2003,
 abstract = {This paper addresses the problem of training sequence design for multiple-antenna transmissions over quasi-static frequency-selective channels. To achieve the channel estimation minimum mean square error, the training sequences transmitted from the multiple antennas must have impulse-like auto correlation and zero cross correlation. We reduce the problem of designing multiple training sequences to the much easier and well-understood problem of designing a single training sequence with impulse-like auto correlation. To this end, we propose to encode the training symbols with a space-time code, that may be the same or different from the space-time code that encodes the information symbols.},
 type={2},
 author = {Fragouli, C. and Al-Dhahir, N. and Turin, W.},
 journal = {IEEE Transactions on Wireless Communications},
 pages = {pages 384--391},
 tags = {wireless,channel_coding},
 title = {Training-based channel estimation for multiple-antenna broadband transmissions},
 volume = {vol. 2, no. 2},
 year = {2003}
}



@article{fragouli_turbo_2001,
 abstract = {This paper addresses turbo-encoder design for coding with high spectral efficiency using parallel concatenated trellis-coded modulation and symbol interleaving. The turbo-encoder design involves the constituent encoder design and the interleaver design. The constituent encoders are optimized for symbol-wise effective free distance, and each has an infinite symbol-wise impulse response. We identify the canonical structures for the constituent encoder search space. In many cases of practical interest, the optimal structure for these constituent encoders connects the memory elements in a single row. This single row generally applies to turbo code constituent encoders for parallel concatenation and is not restricted to symbol interleaving. To lower the error floor, a new semi-random interleaver design criteria and a construction method extends the spread-interleaver concept introduced by Divsalar and Pollara (1995). Simulation results show that the proposed system employing symbol interleaving can converge at a lower signal-to-noise ratio than previously reported systems. We report simulation results between 0.5 and 0.6 db from constrained capacity for rates of 2 and 4 bits/s/Hz.},
 type={2},
 author = {Fragouli, C. and Wesel, R. D.},
 journal = {IEEE Transactions on Communications, no. 3},
 pages = {pages 425--435},
 tags = {channel_coding},
 title = {Turbo encoder design for symbol interleaved parallel concatenated trellis coded modulation},
 volume = {vol. 49},
 year = {2001}
}



@article{fragouli_turbo_2001-1,
 abstract = {This paper presents parallel concatenated turbo codes that employ a non-uniform constellation to achieve shaping gain. The output signal approximates the Gaussian distribution by using equally likely signals with unequal spacing (a non-uniform constellation). The small distance of points near the center of the constellation may lead to a small overall free distance and thus a high error floor for turbo codes. We avoid this situation by a two-step design procedure, that first creates an interleaver, and then identifies the constituent encoders that maximize the turbo code free distance. Simulation results for 4 bits/sec/Hz show that this use of shaping can offer an improvement of approximately 0.2 dB for turbo codes.},
 type={4},
 author = {Fragouli, C. and Wesel, R. D. and Sommer, D. and Fettweis, G. P.},
 journal = {ICC 2001, Helsinki, Finland},
 pages = {pages 70--73},
 tags = {channel_coding},
 title = {Turbo {Codes} with {Non}-{Uniform} {Constellation}},
 volume = {vol. 1},
 year = {2001}
}



@article{fragouli_wireless_2007,
 abstract = {Wireless networks suffer from a variety of unique problems such as low throughput, dead spots, and inadequate support for mobility. However, their characteristics such as the broadcast nature of the medium, spatial diversity, and significant data redundancy, provide opportunities for new design principles to address these problems. There has been recent interest in employing network coding in wireless networks. This paper explores the case for network coding as a unifying design paradigm for wireless networks, by describing how it addresses issues of throughput, reliability, mobility, and management. We also discuss the practical challenges facing the integration of such a design into the network stack.},
 type={4},
 author = {Fragouli, C. and Katabi, D. and Markopoulou, Athina and Medard, M. and Rahul, H.},
 journal = {IEEE MILCOM},
 tags = {network_coding,wireless},
 title = {Wireless network coding: opportunities and challenges},
 year = {2007}
}



@article{fragouli_wireless_2015,
 type={4},
 author = {Fragouli, C. and Czap, L. and Prabhakaran, V. M. and Diggavi, Suhas},
 journal = {The Proceedings of the IEEE},
 tags = {security},
 title = {Wireless network security: building on erasures},
 year = {2015}
}



@inproceedings{gatzianas_feedback-based_2012,
 type={4},
 author = {Gatzianas, Marios and Saeedi, Shirin and Fragouli, C.},
 booktitle = {Proceedings {NETCOD}},
 month = {June},
 tags = {wireless,network_coding},
 title = {Feedback-based coding algorithms for broadcast erasure channels with degraded message sets},
 year = {2012}
}



@inproceedings{georghiu_degraded_2011,
 type={4},
 author = {Georghiu, S. and Saeedi, Shirin and Fragouli, C. and Toledo, A.},
 booktitle = {{IEEE} {International} {Symposium} on {Network} {Coding} ({NetCod})},
 tags = {network_coding},
 title = {Degraded multicasting with network coding over the combination network},
 year = {2011}
}



@article{gjoka_loss_2007,
 abstract = {Network tomography infers internal network characteristics by sending and collecting probe packets from the network edge. Traditional tomographic techniques for general topologies typically use a mesh of multicast trees and/or unicast paths to cover the entire graph, which is suboptimal from the point of view of bandwidth efficiency and estimation accuracy. In this paper, we investigate an active probing method for link loss inference in a general topology, where multiple sources and receivers are used and intermediate nodes are equipped with network coding, in addition to unicast and multicast, capabilities. With our approach, each link is traversed by exactly one packet, which is in general a linear combination of the original probes. The receivers infer the loss rate on all links by observing not only the number but also the contents of the received probes. In this paper: (i) we propose an orientation algorithm that creates an acyclic graph with the maximum number of identifiable edges (ii) we define probe combining coding schemes and discuss some of their properties and (iii) we present simulation results over realistic topologies using Belief-Propagation (BP) algorithms.},
 type={4},
 author = {Gjoka, M. and Fragouli, C. and Sattari, P. and Markopoulou, Athina},
 journal = {IEEE GLOBECOM},
 tags = {network_coding},
 title = {Loss {Tomography} in {General} {Topologies} with {Network} {Coding}},
 year = {2007}
}



@article{goseling_network_2009,
 abstract = {We consider the information exchange problem where each in a set of terminals transmits information to all other terminals in the set, over an undirected network. We show that the design of only a single network code for multicasting is sufficient to achieve an arbitrary point in the achievable rate region. We also provide an alternative proof for the set of achievable rate tuples.},
 type={4},
 author = {Goseling, J. and Fragouli, C. and Diggavi, Suhas N.},
 doi = {10.1109/lcomm.2009.081288},
 journal = {Communications Letters, IEEE},
 keywords = {network coding, encodingmulticasting network code, undirected information exchange},
 month = {January},
 number = {1},
 pages = {25--27},
 tags = {network_coding},
 title = {Network coding for undirected information exchange},
 volume = {13},
 year = {2009}
}




@inproceedings{hosszu_combinatorial_2015,
 type={4},
 author = {Hosszu, Eva and Fragouli, C. and Tapolcai, Janos},
 booktitle = {{IEEE} 16th {International} {Conference} on {High} {Performance} {Switching} and {Routing} ({HPSR})},
 month = {July},
 tags = {channel_coding},
 title = {Combinatorial error detection in linear encoders},
 year = {2015}
}



@article{jafari_siavoshani_bottleneck_2007,
 abstract = {The performance of peer-to-peer (P2P) networks depends critically on the good connectivity of the overlay topology. In this paper we study P2P networks for content distribution (such as Avalanche) that use randomized network coding techniques. The basic idea of such systems is that peers randomly combine and exchange linear combinations of the source packets. A header appended to each packet specifies the linear combination that the packet carries. In this paper we show that the linear combinations a node receives from its neighbors reveal structural information about the network. We propose algorithms to utilize this observation for topology management to avoid bottlenecks and clustering in network-coded P2P systems. Our approach is decentralized, inherently adapts to the network topology, and reduces substantially the number of topology rewirings that are necessary to maintain a well connected overlay. Moreover, this is done passively during the normal content distribution. This work demonstrates another value of using network coding and complements previous work that showed network coding achieves high utilization of the network resources.},
 type={4},
 author = {Jafari Siavoshani, Mahdi and Fragouli, C. and Diggavi, Suhas N. and Gkantsidis, C.},
 journal = {SIGCOMM INM},
 tags = {network_coding},
 title = {Bottleneck discovery and overlay management in network coded {Peer}-to-{Peer} systems},
 year = {2007}
}



@inproceedings{jafari_siavoshani_capacity_2009,
 abstract = {The min-cut value towards a single receiver in a network with unit capacity edges can be achieved by routing a single bit. The multicast theorem in network coding shows that, the common min-cut value towards N ges 1 receivers can also be achieved using packets of length logN bits, if the operations the intermediate nodes perform are deterministically known at the receivers. We here calculate the capacity in the case where these operations are unknown, and characterize how the capacity depends on the min-cut value and the packet length.},
 type={4},
 author = {Jafari Siavoshani, Mahdi and Mohajer, S. and Fragouli, C. and Diggavi, Suhas N.},
 booktitle = {Information {Theory}, 2009. {ISIT} 2009. {IEEE} {International} {Symposium} on},
 doi = {10.1109/isit.2009.5205851},
 keywords = {multicast theorem, noncoherent network coding, packet length, single bit routing, source coding, telecommunication network routingmin-cut value towards},
 month = {July},
 pages = {273--277},
 tags = {network_coding,wireless},
 title = {On the capacity of non-coherent network coding},
 year = {2009}
}



@article{jafari_siavoshani_capacity_2011,
 abstract = {We consider the problem of multicasting information from a source to a set of receivers over a network where intermediate network nodes perform randomized network coding operations on the source packets. We propose a channel model for the non-coherent network coding introduced by Koetter and Kschischang in [6], that captures the essence of such a network operation, and calculate the capacity as a function of network parameters. We prove that use of subspace coding is optimal, and show that, in some cases, the capacity-achieving distribution uses subspaces of several dimensions, where the employed dimensions depend on the packet length. This model and the results also allow us to give guidelines on when subspace coding is beneficial for the proposed model and by how much, in comparison to a coding vector approach, from a capacity viewpoint. We extend our results to the case of multiple source multicast that creates a virtual multiple access channel.},
 type={2},
 author = {Jafari Siavoshani, Mahdi and Mohajer, Soheil and Fragouli, C. and Diggavi, Suhas N.},
 journal = {IEEE Transactions on Information Theory (Special Issue on Facets of Coding Theory: from Algorithms to Networks)},
 month = {February},
 number = {2},
 pages = {1046--1066},
 tags = {network_coding},
 title = {On the capacity of non-coherent network coding},
 volume = {57},
 year = {2011}
}



@inproceedings{jafari_siavoshani_compressed_2009,
 abstract = {In networks that employ network coding, two main approaches have been proposed in the literature to allow the receivers to recover the source information: (i) use of coding vectors, that keep track of the linear combinations the received packets contain, and (ii) subspace coding, that dispenses of the need to know the linear combinations, since information is conveyed from the choice of subspaces alone. Both these approaches impose the strong requirement that all source packets get potentially combined. We here present a third approach that relaxes this assumption, and is thus not a special case from either of the previous two. This relaxation allows to employ compressed coding vectors to efficiently convey the coding coefficients, without altering the operation of intermediate network nodes. We develop optimal designs for such vectors.},
 type={4},
 author = {Jafari Siavoshani, Mahdi and Keller, L. and Argyraki, K. and Fragouli, C.},
 booktitle = {Information {Theory}, 2009. {ISIT} 2009. {IEEE} {International} {Symposium} on},
 doi = {10.1109/isit.2009.5206041},
 keywords = {linear codes, data compression, intermediate network node, linear combination, subspace coding, vectorscompressed network coding vector},
 month = {July},
 pages = {109--113},
 tags = {network_coding,sensor_networks},
 title = {Compressed network coding vectors},
 year = {2009}
}



@inproceedings{jafari_siavoshani_group_2011,
 type={4},
 author = {Jafari Siavoshani, Mahdi and Mishra, Shaunak and Diggavi, Suhas N. and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 month = {August},
 tags = {security},
 title = {Group secret key agreement over state-dependent wireless broadcast channels},
 year = {2011}
}



@article{jafari_siavoshani_locating_2008,
 abstract = {We examine networks that employ network coding, and are subject to Byzantine attacks. We consider systems where an appropriate network error correcting scheme is employed that is able to correct (up to a certain number of) Byzantine errors. Given this setup, we formulate the problem of locating these malicious nodes that insert errors. We utilize the subspace properties of (randomized) network coding to develop algorithms to locate the Byzantine attackers.},
 type={4},
 author = {Jafari Siavoshani, Mahdi and Fragouli, C. and Diggavi, Suhas N.},
 journal = {Network Coding Workshop: Theory and Applications},
 tags = {network_coding},
 title = {On {Locating} {Byzantine} {Attackers}},
 year = {2008}
}



@article{jafari_siavoshani_noncoherent_2008,
 abstract = {We examine the problem of multiple sources transmitting information to one or more receivers that require the information from all the sources, over a network where the network nodes perform randomized network coding. We consider the noncoherent case, where neither the sources nor the receivers have any knowledge of the intermediate nodes operations. We formulate a model for this problem, inspired from block- fading noncoherent MIMO communications. We prove, using information theoretic tools, that coding over subspaces is sufficient to achieve the capacity, and give bounds for the capacity. We then examine the associated combinatorial problem of code design. We extend the work by Koetter and Kschischang [3] to code constructions for the multisource case. Our constructions can also be viewed as coding for the noncoherent multiple-access finite-field channel.},
 type={4},
 author = {Jafari Siavoshani, Mahdi and Fragouli, C. and Diggavi, Suhas N.},
 journal = {IEEE International Symposium on Information Theory (ISIT)},
 tags = {network_coding,wireless},
 title = {Noncoherent multi-source network coding},
 year = {2008}
}



@inproceedings{jafari_siavoshani_subspace_2007,
 abstract = {Randomized network coding has network nodes randomly combine and exchange linear combinations of the source packets. A header appended to the packet, called coding vector, specifies the exact linear combination that each packet carries. The main contribution of this work is to investigate properties of the subspacesspanned by the collected coding vectors in each network node. We use these properties to exhibit the relationship between the network topology and the subspaces collected at the nodes. This allows us to passively infer the network topology for a general class of graphs.},
 type={4},
 author = {Jafari Siavoshani, Mahdi and Fragouli, C. and Diggavi, Suhas N.},
 booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},
 tags = {network_coding},
 title = {Subspace properties of randomized network coding},
 year = {2007}
}



@article{jafari_siavoshani_subspace_2008,
 type={2},
 author = {Jafari Siavoshani, Mahdi and Fragouli, C. and Diggavi, Suhas N.},
 journal = {IEEE Transactions on Information Theory},
 tags = {network_coding},
 title = {Subspace properties of network coding and their applications},
 year = {2008}
}



@inproceedings{jafarian_distributed_2009,
 abstract = {This paper addresses the problem of distributed rate allocation for a class of multicast networks employing linear network coding. The goal is to minimize the cost (for example, the sum rates allocated to each link in the network) while satisfying a multicast rate requirement for each destination in the network. In essence, this paper aims to achieve network capacity while ensuring that the cost of operation (equivalently, the rate allocated per link in the network) is minimal. This paper uses a belief propagation framework to obtain a distributed algorithm for the rate allocation problem. Simulation results are presented to demonstrate the convergence of this algorithm to the optimal rate allocation solution.},
 type={4},
 author = {Jafarian, A. and Lee, Sang Hyun and Vishwanath, S. and Fragouli, C.},
 booktitle = {Sensor, {Mesh} and {Ad} {Hoc} {Communications} and {Networks} {Workshops}, 2009. {SECON} {Workshops} '09. 6th {Annual} {IEEE} {Communications} {Society} {Conference} on},
 doi = {10.1109/sahcnw.2009.5172929},
 keywords = {cost minimization, distributed algorithm, distributed algorithms, distributed rate allocation, linear codes, linear network coding, minimisationbelief propagation framework, multicast network, network capacity, network-coded system},
 month = {June},
 pages = {1--6},
 tags = {wireless},
 title = {Distributed {Rate} {Allocation} for {Network}-coded {Systems}},
 year = {2009}
}



@inproceedings{karamchandani_function_2010,
 abstract = {This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.},
 type={4},
 author = {Karamchandani, Nikhil and Keller, L. and Fragouli, C. and Franceschetti, Massimo},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 doi = {10.1109/isit.2010.5513755},
 tags = {wireless,network_coding},
 title = {Function computation via subspace coding},
 year = {2010}
}



@article{karamchandani_function_2012,
 abstract = {This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.},
 type={4},
 author = {Karamchandani, Nikhil and Keller, L. and Fragouli, C. and Franceschetti, Massimo},
 doi = {10.1016/j.phycom.2012.02.007},
 issn = {1874-4907},
 journal = {Physical Communication},
 keywords = {Wireless sensor network},
 number = {0},
 tags = {sensor_networks},
 title = {Function computation via subspace coding},
 url = {http://www.sciencedirect.com/science/article/pii/S1874490712000201},
 year = {2012}
}



@inproceedings{karmoose_preserving_2017,
 type={4},
 author = {Karmoose, M. and Song, L. and Cardone, M. and Fragouli, C.},
 booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},
 tags = {network_coding},
 title = {Preserving {Privacy} while {Broadcasting}: k-{Limited}-{Access} {Schemes}},
 year = {2017}
}



@inproceedings{karmoose_privacy_2018,
 type={4},
 author = {Karmoose, M. and Song, L. and Cardone, M. and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 tags = {network_coding},
 title = {Privacy in {Index} {Coding}: {Improved} {Bounds} and {Coding} {Schemes}},
 year = {2018}
}



@article{karmoose_privacy_2019,
 type={2},
 author = {Karmoose, M. and Song, L. and Cardone, M. and Fragouli, C.},
 journal = {IEEE Transactions on Information Theory},
 tags = {network_coding},
 title = {Privacy in {Index} {Coding}: k-{Limited}-{Access} {Schemes}},
 year = {2019}
}



@inproceedings{karmoose_private_2017,
 type={4},
 author = {Karmoose, M. and Song, L. and Cardone, M. and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 month = {January},
 tags = {network_coding},
 title = {Private {Broadcasting}: an {Index} {Coding} {Approach}},
 year = {2017}
}



@inproceedings{karmoose_simplifying_2016,
 type={4},
 author = {Karmoose, M. and Cardone, M. and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 tags = {network_coding},
 title = {Simplifying {Wireless} {Social} {Caching}},
 year = {2016}
}



@inproceedings{karmoose_simplifying_2018,
 type={2},
 author = {Karmoose, M. and Cardone, M. and Fragouli, C.},
 booktitle = {{IEEE} {Transactions} on {Communications}},
 tags = {network_coding},
 title = {Simplifying {Wireless} {Social} {Caching} via {Network} {Coding}},
 year = {2018}
}



@inproceedings{karmoose_using_2019,
 type={4},
 author = {Karmoose, M. and Fragouli, C. and Diggavi, S. N. and Misoczki, Rafael and Yang, Lily L. and Zhang, Zhenliang},
 booktitle = {{IEEE} {Communications} {Letters}},
 tags = {security},
 title = {Using mm-{Waves} for {Secret} {Key} {Establishmen}},
 year = {2019}
}



@inproceedings{keller_function_2010,
 abstract = {This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.},
 type={4},
 author = {Keller, L. and Karamchandani, Nikhil and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} on {Network} {Coding} ({NetCod})},
 doi = {10.1109/NETCOD.2010.5487679},
 tags = {wireless,network_coding},
 title = {Function computation over linear channels},
 year = {2010}
}



@inproceedings{keller_identity_2009,
 abstract = {In a significant class of sensor-network applications, the identities of the reporting sensors constitute the bulk of the communicated data, whereas the message itself can be as small as a single bit - for instance, in many cases, sensors are used to detect whether and where a certain interesting condition occured, or to track incremental environmental changes at fixed locations. In such scenarios, the traditional network-protocol paradigm of separately specifying the source identity and the message in distinct fields leads to inefficient communication. This work addresses the question of how should communication happen in such identity-aware sensor networks. We reexamine the traditional source-identity/message separation and propose a scheme for jointly encoding the two. We use this to develop a communication method for identity-aware sensor networks and show it to be energy efficient, simple to implement, and gracefully adaptable to scenarios frequently encountered in sensor networks - for instance, node failures, or large numbers of nodes where only few are active during each reporting round.},
 type={4},
 author = {Keller, L. and Jafari Siavoshani, Mahdi and Fragouli, C. and Argyraki, K. and Diggavi, Suhas N.},
 booktitle = {{INFOCOM} 2009, {IEEE}},
 doi = {10.1109/infcom.2009.5062142},
 keywords = {identity aware sensor networks, source-identity-message separation, wireless sensor networks, wireless sensor networksenergy efficient},
 month = {April},
 note = {ISSN: 0743-166X},
 pages = {2177--2185},
 tags = {sensor_networks},
 title = {Identity aware sensor networks},
 year = {2009}
}



@article{keller_joint_2010,
 abstract = {In a significant class of sensor-network applications, the identities of the reporting sensors constitute the bulk of the communicated data, whereas the message itself can be as small as a single bit—for instance, in many cases, sensors are used to detect whether and where a certain interesting condition occurred, or to track incremental environmental changes at fixed locations. In such scenarios, the traditional network-protocol paradigm of separately specifying the source identity and the message in distinct fields leads to inefficient communication. This work addresses the question of how communication should happen in such identity-aware sensor networks. We calculate theoretical performance bounds for this type of communication, where “performance” refers to the number of transmitted bits. We propose a communication protocol, where the identity and message of each source are specified jointly using subspace coding. We show through analysis and simulation that our protocol's performance is close to optimal and compare it to the performance of a traditional protocol, where identity and message are specified separately.},
 type={4},
 author = {Keller, L. and Jafari Siavoshani, Mahdi and Argyraki, K. and Fragouli, C. and Diggavi, Suhas N.},
 doi = {10.1109/JSAC.2010.100913},
 journal = {IEEE JSAC on Wireless Sensor Networks},
 tags = {sensor_networks},
 title = {Joint identity-message coding for sensor networks},
 year = {2010}
}



@inproceedings{keller_microcast_2012,
 abstract = {Video streaming is one of the increasingly popular, as well as demanding, applications on smartphones today. In this paper, we consider a group of smartphone users, within proximity of each other, who are interested in watching the same video from the Internet at the same time. The common practice today is that each user downloads the video independently using her own cellular connection, which often leads to poor quality. We design, implement, and evaluate a novel system, MicroCast, that uses the resources on all smartphones of the group in a cooperative way so as to improve the streaming experience. Each 4 phone uses simultaneously two network interfaces: the cellular to connect to the video server and the WiFi to connect to the rest of the group. Key ingredients of our design include the following. First, we propose a scheduling algorithm, MicroDownload, that decides which parts of the video each phone should download from the server, based on the phones’ download rate. Second, we propose a novel all-to-all local dissemination scheme, MicroNC-P2, for sharing content among group members, which outperforms state-of-the-art peer-to-peer schemes in our setting. MicroNC-P2 is designed to exploit WiFi overhearing and network coding, based on a local packet broadcast framework, MicroBroadcast, which we developed specifically for Android phones. We evaluate MicroCast on a testbed consisting of seven Android phones, and we show that it brings significant performance benefits without battery penalty.},
 type={4},
 author = {Keller, L. and Le, A. and Cici, B. and Seferoglu, H. and Fragouli, C. and Markopoulou, A.},
 booktitle = {Proceedings of the 10th international conference on {Mobile} systems, applications, and services},
 pages = {57--70},
 publisher = {ACM},
 tags = {network_coding,wireless},
 title = {Microcast: {Cooperative} video streaming on smartphones},
 year = {2012}
}



@inproceedings{keller_network_2011,
 abstract = {This paper experimentally studies the reliability and delay of flooding based multicast protocols for a sniper detection application. In particular using an emulator it studies under which conditions protocols based on network coding deliver performance improvements compared to classic flooding. It then presents an implementation of such protocols on mobile phones.},
 type={4},
 author = {Keller, L. and Karaagac, A. and Fragouli, C. and Argyraki, K.},
 booktitle = {{IEEE} {Wireless} {Measurements} {Workshop} ({WinMee})},
 month = {May},
 tags = {network_coding,wireless},
 title = {A network coding approach to the sniper detection problem},
 year = {2011}
}



@inproceedings{keller_online_2008,
 abstract = {Consider a source broadcasting M packets to N receivers over independent erasure channels, where perfect feedback is available from the receivers to the source, and the source is allowed to use coding. We investigate offline and online algorithms that optimize delay, both through theoretical analysis as well as simulation results.},
 type={4},
 author = {Keller, L. and Drinea, Eleni and Fragouli, C.},
 booktitle = {Network {Coding}, {Theory} and {Applications}, 2008. {NetCod} 2008. {Fourth} {Workshop} on},
 doi = {10.1109/netcod.2008.4476183},
 keywords = {network coding, feedback, broadcasting, encoding, online broadcasting},
 month = {January},
 pages = {1 -- 6},
 tags = {network_coding,wireless},
 title = {Online {Broadcasting} with {Network} {Coding}},
 year = {2008}
}



@article{keller_sensecode_2009,
 abstract = {Designing a communication protocol for sensor networks often involves obtaining the “right” trade-off between energy efficiency and reliability. In this paper, we show that network coding provides a means to elegantly balance these two goals. We present the design and implementation of SenseCode, a collection protocol for sensor networks—and, to the best of our knowledge, the first such protocol to employ network coding. SenseCode provides a way to gracefully introduce a configurable amount of redundant information in the network, thereby increasing reliability in the face of packet loss. We compare SenseCode to the best (to our knowledge) existing alternative and show that it achieves higher reliability (typically 20\%, in certain cases up to 30\%), while consuming the same amount of network resources. We have implemented SenseCode as a TinyOs module, and evaluate it through TOSSIM simulations, as well as a testbed of 30 TinyNode sensors deployed in our department building},
 type={4},
 author = {Keller, L. and Atsan, Emre and Argyraki, K. and Fragouli, C.},
 journal = {EPFL Technical Report, in submission},
 tags = {network_coding,sensor_networks},
 title = {{SenseCode}: {Network} coding for reliable sensor networks},
 year = {2009}
}



@article{keller_sensecode_2013,
 type={2},
 author = {Keller, L. and Atsan, Emre and Argyraki, K. and Fragouli, C.},
 journal = {IEEE Transactions on Sensor Networks},
 tags = {sensor_networks},
 title = {{SenseCode}: {Network} {Coding} for {Reliable} {Sensor} {Networks}},
 year = {2013}
}



@article{komninakis_adaptive_2000,
 abstract = {This paper addresses the problem of adaptive channel tracking and equalization for multi-input multi-output (MIMO) time-variant frequency-selective channels. A finite-length minimum-mean-squared-error decision-feedback equalizer (MMSE-DFE) performs the equalization task, while a Kalman filter tracks the MIMO channel, which models the corrupting effects of inter-symbol interference (ISI), inter-user interference (IUI), and noise. The Kalman tracking is aided by previous hard decisions produced by the DFE, with a decision delay \&gt;0, which causes the Kalman filter to track the channel with a delay. A channel prediction module bridges the time gap between the channel estimates produced by the Kalman filter and those needed for the DFE adaptation. The proposed algorithm offers good tracking behavior for multi-user fading ISI channels at the expense of higher complexity.},
 type={4},
 author = {Komninakis, C. and Fragouli, C. and Sayed, A. H. and Wesel, R. D.},
 journal = {ICC 2000, New Orleans, Louisiana, June 18-22},
 pages = {pages 1655--1659},
 tags = {wireless},
 title = {Adaptive {Multi}-{Input} {Multi}-{Output} {Fading} {Channel} {Equalization} using {Kalman} {Estimation}},
 volume = {vol. 3},
 year = {2000}
}



@article{komninakis_channel_1999,
 abstract = {This paper addresses the problem of training sequence design for multiple-antenna transmissions over quasi-static frequency-selective channels. To achieve the channel estimation minimum mean square error, the training sequences transmitted from the multiple antennas must have impulse-like auto correlation and zero cross correlation. We reduce the problem of designing multiple training sequences to the much easier and well-understood problem of designing a single training sequence with impulse-like auto correlation. To this end, we propose to encode the training symbols with a space-time code, that may be the same or different from the space-time code that encodes the information symbols. Optimal sequences do not exist for all training sequence lengths and constellation alphabets. We also propose a method to easily identify training sequences that belong to a standard 2m-PSK constellation for an arbitrary training sequence length and an arbitrary number of unknown channel taps. Performance bounds derived indicate that these sequences achieve near-optimum performance.},
 type={4},
 author = {Komninakis, C. and Fragouli, C. and Wesel, R. D. and Sayed, A. H.},
 journal = {33rd Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, October 24-27},
 tags = {wireless},
 title = {Channel estimation and equalization in fading},
 year = {1999}
}



@article{komninakis_multi-input_2002,
 abstract = {This paper addresses the problem of channel tracking and equalization for multi-input multi-output (MIMO) time-varying frequency-selective channels. These channels model the effects of inter-symbol interference (ISI), co-channel interference (CCI), and noise. A low-order autoregressive model approximates the MIMO channel variation and facilitates tracking via a Kalman filter. Hard decisions to aid Kalman tracking come from a MIMO finite-length minimum-mean-squared-error decision-feedback equalizer (MMSE-DFE), which performs the equalization task. Since the optimum DFE for a wide range of channels produces decisions with a delay \&gt; 0, the Kalman filter tracks the channel with a delay. A channel prediction module bridges the time gap between the channel estimates produced by the Kalman filter and those needed for the DFE adaptation. The proposed algorithm offers good tracking behavior for multiuser fading ISI channels at the expense of higher complexity than conventional adaptive algorithms. Applications include synchronous multiuser detection of independent transmitters, as well as coordinated transmission through many transmitter/receiver antennas, for increased data rate.},
 type={2},
 author = {Komninakis, C. and Fragouli, C. and Sayed, A. H. and Wesel, R. D.},
 journal = {IEEE Transactions on Signal Processing},
 pages = {pages 1065--1076},
 tags = {wireless},
 title = {Multi-{Input} {Multi}-{Output} {Fading} {Channel} {Tracking} and {Equalization} using {Kalman} {Estimation}},
 volume = {vol. 50},
 year = {2002}
}



@article{le_microcast_2015,
 type={2},
 author = {Le, A. and Keller, L. and Seferoglu, H. and Cici, B. and Fragouli, C. and Markopoulou, A.},
 journal = {IEEE Transactions on Networking},
 tags = {network_coding,wireless},
 title = {{MicroCast}: {Cooperative} {Video} {Streaming} using {Cellular} and {Local} {Connections}},
 year = {2015}
}



@inproceedings{le_microplay_2012,
 abstract = {Smartphones are an ideal platform for local multiplayer games, thanks to their computational and networking capabilities as well as their popularity and portability. However, existing game engines do not exploit the locality of players to improve game latency. In this paper, we propose MicroPlay, a complete networking framework for local multiplayer mobile games. To the best of our knowledge, this is the first framework that exploits local connections between smartphones, and in particular, the broadcast nature of the wireless medium, to provide smooth, accurate rendering of all players with two desired properties. First, it performs direct-input rendering (i.e., without any inter- or extrapo- lation of game state) for all players; second, it provides very low game latency. We implement a MicroPlay prototype on Android phones, as well as an example multiplayer car racing game, called Racer, in order to demonstrate MicroPlay’s capabilities. Our experiments show that cars can be rendered smoothly, without any prediction of state, and with only 20–30 ms game latency.},
 type={4},
 author = {Le, A. and Keller, L. and Fragouli, C. and Markopoulou, A.},
 booktitle = {Proceedings of the first {ACM} international workshop on {Mobile} gaming},
 pages = {13--18},
 publisher = {ACM},
 tags = {network_coding,wireless},
 title = {{MicroPlay}: a networking framework for local multiplayer games},
 year = {2012}
}



@article{lettieri_low_1997,
 abstract = {Energy efficiency, which directly affects battery life and portability, is perhaps the single most important design metric in hand-held computing devices capable of mobile networking over wireless radio links. By virtue of their being relatively thin clients, a high fraction of the power consumption in portable wireless computing devices is accounted for by the transport of packet data over the wireless link. In particular, the error control strategy (eg. convolutional and block channel coding for forward error correction (FEC), ARQ protocols, hybrids) used for wireless link data transport has a direct impact on battery power consumption. Error control has traditionally been studied by channel coding researchers from the perspective of selecting an error control scheme to achieve a desired level of radio channel performance. We instead study the problem of error control from a perspective more relevant to battery operated devices: the amount of battery energy consumed to transmit bits across a wireless link. This includes both the physical transmission of useful and redundancy data, as well as the computation of the error control redundancy. We first describe a novel error control where the most battery energy efficient hybrid combination of an appropriate FEQ and ARQ protocol is chosen, and adapted over time, for each stream (ATM virtual circuit or IP/RSVP flow). Next, we present analysis and simulation results to guide the selection and adaptation of the most energy efficient error control scheme as a function of quality of service, packet size, and channel state.},
 type={4},
 author = {Lettieri, P. and Fragouli, C. and Srivastava, M. B.},
 doi = {10.1145/262116.262142},
 journal = {ACM/IEEE Mobicom},
 pages = {139--150},
 tags = {wireless},
 title = {Low power error control for wireless links},
 year = {1997}
}



@article{loyola_network-coded_2008,
 abstract = {We consider the problem of finding the minimum number of transmissions in an ad-hoc network for all-to-all broadcasting using network coding. This work generalizes previous results for canonical topologies such as the circle and the wrap around grid to the finite-sized line, and non-wrap-around grid. The latter topologies better reflect network coding in random topologies, since the dissemination of information is "directional", in a sense that information usually arrives via the neighbors on the path to its originator instead of from all possible directions. We find that while the line topology requires a higher number of transmissions compared to the circle, this is interestingly not the case for the grid. We further present simulation results on a heuristic that estimates the required minimum number of transmissions in random wireless topologies and compare it to the optimum solution, as well as previously proposed heuristics.},
 type={4},
 author = {Loyola, L. and Souza, T. De and Widmer, J. and Fragouli, C.},
 journal = {Network Coding Workshop: Theory and Applications},
 tags = {network_coding,wireless},
 title = {Network-coded broadcast: from canonical networks to random topologies},
 year = {2008}
}



@article{lun_analysis_2006,
 abstract = {We consider the following packet coding scheme: The coding node has a fixed, finite memory in which it stores packets formed from an incoming packet stream, and it sends packets formed from random linear combinations of its memory contents. We analyze the scheme in two settings: as a self-contained component in a network providing reliability on a single link, and as a component employed at intermediate nodes in a block-coded end-to-end connection. We believe that the scheme is a good alternative to automatic repeat request when feedback is too slow, too unreliable, or too difficult to implement.},
 type={4},
 author = {Lun, D. and Pakzad, P. and Fragouli, C. and Medard, M. and Koetter, R.},
 journal = {2nd Network Coding Workshop},
 tags = {network_coding},
 title = {An {Analysis} of {Finite}-{Memory} {Random} {Linear} {Coding} on {Packet} {Streams}},
 year = {2006}
}



@article{mao_secure_2020,
 type={4},
 author = {Mao, Y and Diggavi, S. and Fragouli, C. and Tabuada, P.},
 journal = {IEEE Control Systems Letters},
 tags = {security},
 title = {Secure {State}-{Reconstruction} {Over} {Networks} {Subject} to {Attacks}},
 year = {2020}
}



@article{markopoulou_network_2013,
 type={2},
 author = {Markopoulou, A. and Gjoka, M. and Fragouli, C.},
 journal = {IEEE Transactions on Information Theory},
 tags = {network_coding},
 title = {A network coding approach to network tomography},
 year = {2013}
}



@article{mohajer_approximate_2009,
 type={2},
 author = {Mohajer, S. and Diggavi, Suhas N. and Fragouli, C. and Tse, D.},
 journal = {IEEE Transactions on Information Theory},
 tags = {network_coding},
 title = {Approximate capacity of a class of gaussian interference-relay networks},
 year = {2009}
}



@article{mohajer_approximate_2011,
 type={2},
 author = {Mohajer, S. and Diggavi, Suhas N. and Fragouli, C. and Tse, D.},
 journal = {IEEE Transactions on Information Theory},
 month = {May},
 number = {5},
 pages = {2837--2864},
 tags = {wireless},
 title = {Approximate capacity of a class of relay-interference networks},
 volume = {57},
 year = {2011}
}



@inproceedings{mohajer_capacity_2009,
 abstract = {The wireless multiple-unicast problem is considered over a layered network, where the rates of transmission are limited by the relaying and interference effect. The deterministic model introduced is used to capture the broadcasting and multiple access effects. The capacity region of the Z-chain relay-interference network is fully characterized. In order to solve the problem, we introduce a new achievability scheme based on ldquointerference neutralizationrdquo and a new analysis technique to bound the number of non-interfering (pure) signals},
 type={4},
 author = {Mohajer, S. and Diggavi, Suhas N. and Fragouli, C. and Tse, D.},
 booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},
 tags = {network_coding,wireless},
 title = {Capacity of deterministic {Z}-chain relay-interference network},
 year = {2009}
}



@inproceedings{mohajer_capacity_2009-1,
 abstract = {We consider multisource non-coherent network coding, where multiple sources send information to one or multiple receivers. We prove that this is equivalent to a ldquosubspacerdquo channel, that takes subspaces as inputs and outputs. We then show that the rate of each individual receiver is upper bounded as deltai(T - delta1 - delta2), where deltai is what we define to be the ldquodominatingrdquo dimension in the subspace codebook of source i, and T is the ldquocoherencerdquo time of the network.},
 type={4},
 author = {Mohajer, S. and Jafari Siavoshani, Mahdi and Diggavi, Suhas N. and Fragouli, C.},
 booktitle = {Networking and {Information} {Theory}, 2009. {ITW} 2009. {IEEE} {Information} {Theory} {Workshop} on},
 doi = {10.1109/itwnit.2009.5158556},
 keywords = {channel capacity, channel codingchannel capacity, multisource noncoherent network coding, subspace codebook},
 month = {June},
 pages = {130--134},
 tags = {network_coding,wireless},
 title = {On the capacity of multisource non-coherent network coding},
 year = {2009}
}



@article{mohajer_transmission_2008,
 abstract = {In this paper we study the relay-interference wireless network, in which relay (helper) nodes are to facilitate competing information ﬂows over a wireless network. We examine this in the context of a deterministic wireless interaction model, which eliminates the channel noise and focuses on the signal interactions. Using this model, we show that almost all the known schemes such as interference suppression, interference alignment and interference separation are necessary for relay-interference networks. In addition, we discover a new interference management technique, which we call interference neutralization, which allows for over-the-air interference removal, without the transmitters having complete access the interfering signals. We show that interference separation, suppression, and neutralization arise in a fundamental manner, since we show complete characterizations for special conﬁgurations of the relay-interference network.},
 type={4},
 author = {Mohajer, S. and Diggavi, Suhas N. and Fragouli, C. and Tse, D.},
 journal = {IEEE Allerton},
 tags = {network_coding,wireless},
 title = {Transmission techniques for relay-interference networks},
 year = {2008}
}



@inproceedings{nazaroglu_network_2011,
 type={4},
 author = {Nazaroglu, C. and Ozgur, A. and Ebrahimi, Javad and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 month = {August},
 tags = {wireless},
 title = {Network simplification: the {Gaussian} diamond network with {Multiple} {Antennas}},
 year = {2011}
}



@article{nazaroglu_wireless_2014,
 type={2},
 author = {Nazaroglu, C. and Ozgur, A. and Fragouli, C.},
 journal = {IEEE Transactions on Information Theory},
 tags = {wireless},
 title = {Wireless network simplification: the {Gaussian} {N}-{Relay} diamond network},
 year = {2014}
}



@inproceedings{neuberg_mobile_2011,
 type={4},
 author = {Neuberg, C. and Papadimitratos, P. and Fragouli, C. and Urbanke, R.},
 booktitle = {{CISS}},
 month = {March},
 tags = {security},
 title = {A mobile world of security},
 year = {2011}
}



@article{niesen_capacity_2007,
 abstract = {We consider communication through a cascade of discrete memoryless channels (DMCs). The source and destination node of this cascade are allowed to use coding schemes of arbitrary complexity, but the intermediate relay nodes are restricted to process only blocks of a fixed length. We investigate how the processing at the relays must be chosen in order to maximize the capacity of the cascade, that is, the maximum achievable end-to-end rate between the source and the destination. For infinite cascades with fixed intermediate processing length at the relays, we prove that this intermediate processing can be chosen to be identical without loss of optimality, and that the capacity of the cascade coincides with the rate of the best zero-error code of length equal to the block length of the intermediate processing. We further show that for fixed and identical intermediate processing at all relays, convergence of capacity as the length of the cascade goes to infinity is exponentially fast. Finally, we characterize how the block length of the intermediate processing must scale with the length of the cascade to guarantee a constant end-to-end rate. We prove that it is sufficient that the block length scales logarithmically with the network length in order to achieve any rate above the zero-error capacity. We show that in many cases of interest logarithmic growth is also necessary},
 type={2},
 author = {Niesen, U. and Fragouli, C. and Tuninetti, D.},
 journal = {IEEE Transactions on Information Theory},
 pages = {4039--4058},
 tags = {network_coding},
 title = {On the capacity of line networks},
 volume = {53},
 year = {2007}
}



@article{niesen_cascaded_2005,
 abstract = {We consider communication through an infinite cascade of identical discrete memoryless channels. We allow the source and destination nodes to use coding schemes of arbitrary complexity, but restrict the intermediate (relay) nodes to process blocks of a fixed blocklength. We calculate the optimal end-to-end rate, maximized over all possible processings at the relays, and show that it coincides with the end-to-end zero-error capacity. The optimal processing is shown to be identical at each relay and to correspond to a zero-error code. We also show that the rate of convergence to the asymptotic value is exponential in the length of the cascade.},
 type={4},
 author = {Niesen, U. and Fragouli, C. and Tuninetti, D.},
 journal = {Allerton},
 tags = {network_coding},
 title = {On cascaded channels with finite complexity processing at intermediate nodes},
 year = {2005}
}



@article{niesen_scaling_2006,
 abstract = {We consider communication through a cascade of \$L\$ identical Discrete Memory less Channels (DMCs).The source and destination node are allowed to use coding schemes of arbitrary complexity, but the intermediate relay nodes are restricted to process only blocks of \$N\$ symbols.It is well known that for any \$L\$ and \$N{\textbackslash}toınfty\$ the relays can use a capacity achieving code and communicate reliably as long as the rate of this code is below the capacity of the underlying DMC. The capacity of the cascade is hence equal to the network {\textbackslash}em min-cut capacity.For finite \$N\$ and \$L{\textbackslash}toınfty\$, we showed in previous work that the optimal intermediate processing is the highest rate zero-error code of length \$N\$ for the underlying DMC.The capacity of the cascade coincides with the rate of this zero-error code, and is always below the {\textbackslash}em zero-error capacity.In this work, we characterize how \$N\$ must scale with \$L\$ in order to achieve rates in between the zero-error and the min-cut capacity.In particular, we have observed that \$N = {\textbackslash}Theta({\textbackslash}log L)\$ is {\textbackslash}em sufficient to achieve any rate below the min-cut capacity. Here, we develop a novel upper bound on the capacity of cascades with optimal intermediate processing that applies for any \$(N,L)\$ pairs and use it to show that \$N = {\textbackslash}Theta({\textbackslash}log L)\$ is {\textbackslash}em necessary to achieve certain rates above the zero-error capacity. Furthermore, we propose a method to evaluate our upper bound by establishing a connection with the Set-Cover Problem in algorithms.},
 type={4},
 author = {Niesen, U. and Fragouli, C. and Tuninetti, D.},
 journal = {ISIT},
 tags = {network_coding},
 title = {Scaling laws for line networks: from zero-error to min-cut capacity},
 year = {2006}
}



@inproceedings{onaran_broadcast_2013,
 type={4},
 author = {Onaran, Efe and Gatzianas, Marios and Fragouli, C.},
 booktitle = {{IEEE} {Symposium} on {Network} {Coding} ({NetCod})},
 month = {June},
 tags = {wireless},
 title = {Broadcast erasure channel with feedback: the two multicast case - algorithms and bounds},
 year = {2013}
}



@article{pakzad_coding_2005,
 abstract = {We consider a simple network, where a source and destination node are connected with a line of erasure channels. It is well known that in order to achieve the min-cut capacity, the intermediate nodes are required to process the information. We propose coding schemes for this setting, and discuss each scheme in terms of complexity, delay, achievable rate, memory requirement, and adaptability to unknown channel parameters. We also briefly discuss how these schemes can be extended to more general networks.},
 type={4},
 author = {Pakzad, P. and Fragouli, C. and Shokrollahi, A.},
 journal = {ISIT},
 tags = {network_coding},
 title = {Coding schemes for line networks},
 year = {2005}
}



@inproceedings{papadopoulos_achievable_2014,
 type={4},
 author = {Papadopoulos, A. and Czap, L. and Fragouli, C.},
 booktitle = {{IEEE} {Global} {Conference} on {Signal} and {Information} {Processing} ({GlobalSIP})},
 month = {December},
 tags = {security},
 title = {Achievable secrecy in arbitrary erasure networks with feedback},
 year = {2014}
}



@inproceedings{papadopoulos_lp_2015,
 type={4},
 author = {Papadopoulos, A. and Czap, L. and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} on {Infromation} {Theory} ({ISIT})},
 tags = {security},
 title = {{LP} formulations for secrecy over erasure networks with feedback},
 year = {2015}
}



@inproceedings{papadopoulos_secret_2014,
 type={4},
 author = {Papadopoulos, A. and Czap, L. and Fragouli, C.},
 booktitle = {Annual {Allerton} {Conference} on {Communication}, {Control} and {Computing} ({Allerton})},
 month = {September},
 tags = {security},
 title = {Secret message capacity of a line network},
 year = {2014}
}



@inproceedings{saeedi_degraded_2009,
 abstract = {We consider the two message set problem, where a source broadcasts a common message W1 to an arbitrary set of receivers U and a private message W2 to a subset of the receivers P x U. Transmissions occur over linear deterministic channels. For the case where at most two receivers do not require the private message, we give an exact characterization of the capacity region, where achievability is through linear coding.},
 type={4},
 author = {Saeedi, Shirin and Diggavi, Suhas N. and Fragouli, C. and Prabhakaran, V. M.},
 booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},
 tags = {network_coding,wireless},
 title = {On {Degraded} {Two} {Message} {Set} {Broadcast}},
 year = {2009}
}



@inproceedings{saeedi_degraded_2011,
 type={4},
 author = {Saeedi, Shirin and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 month = {August},
 tags = {channel_coding,network_coding},
 title = {Degraded two-message multicast over graphs},
 year = {2011}
}



@inproceedings{safaka_creating_2012,
 address = {New York, NY, USA},
 type={4},
 author = {Safaka, I. and Fragouli, C. and Argyraki, K. and Diggavi, Suhas},
 booktitle = {Proceedings of the 11th {ACM} {Workshop} on {Hot} {Topics} in {Networks}},
 doi = {10.1145/2390231.2390244},
 isbn = {978-1-4503-1776-4},
 keywords = {information-theoretic security, group secrets},
 note = {event-place: Redmond, Washington},
 pages = {73--78},
 publisher = {ACM},
 series = {{HotNets}-{XI}},
 tags = {security},
 title = {Creating shared secrets out of thin air},
 year = {2012}
}



@article{safaka_creating_2016,
 type={2},
 author = {Safaka, I. and Czap, L. and Fragouli, C. and Argyraki, K.},
 journal = {IEEE Transactions on Information Forensics \&amp; Security},
 tags = {security},
 title = {Creating secrets out of packet erasures},
 year = {2016}
}



@inproceedings{safaka_exchanging_2013,
 abstract = {We consider the problem where a group of wireless nodes, connected to the same broadcast domain, want to create pairwise secrets, in the presence of an adversary Eve, who tries to listen in and steal these secrets. Existing solutions assume that Eve cannot perform certain computations (e.g., large-integer factorization) in useful time. We ask the question: can we solve this problem without assuming anything about Eve's computational capabilities? We propose a simple secret-agreement protocol, where the wireless nodes keep exchanging bits until they have agreed on pairwise secrets that Eve cannot reconstruct with very high probability. Our protocol relies on Eve's limited network presence (the fact that she cannot be located at an arbitrary number of points in the network at the same time), but assumes nothing about her computational capabilities. We formally show that, under standard theoretical assumptions, our protocol is information-theoretically secure (it leaks zero information to Eve about the secrets). Using a small wireless testbed of smartphones, we provide experimental evidence that it is feasible for 5 nodes to create thousands of secret bits per second, with their secrecy being independent from the adversary's capabilities.},
 type={4},
 author = {Safaka, I. and Fragouli, C. and Argyraki, K. and Diggavi, Suhas},
 booktitle = {Proceedings of the 32nd {Annual} {IEEE} {International} {Conference} on {Computer} {Communications} ({INFOCOM})},
 keywords = {information-theoretic security, Pairwise secrets},
 note = {event-place: Turin, Italy},
 tags = {security},
 title = {Exchanging {Pairwise} {Secrets} {Efficiently}},
 year = {2013}
}



@inproceedings{safaka_towards_2015,
 type={4},
 author = {Safaka, I. and Czap, L. and Argyraki, K. and Fragouli, C.},
 booktitle = {{IEEE} {Symposium} on {Network} {Coding} ({NetCod})},
 month = {July},
 tags = {security},
 title = {Towards unconditional tor-like anonymity},
 year = {2015}
}



@article{sattari_active_2012,
 type={4},
 author = {Sattari, P. and Fragouli, C. and Markopoulou, A.},
 journal = {Physical Communication},
 note = {Publisher: Elsevier},
 tags = {network_coding},
 title = {Active topology inference using network coding},
 year = {2012}
}



@article{sattari_inferring_2010,
 abstract = {The network coding paradigm is based on the idea that independent information flows can be linearly combined throughout the network to give benefits in terms of throughput, complexity, etc. In this paper, we explore the application of the network coding paradigm to topology inference. Our goal is to infer the topology of a network by sending probes between a given set of multiple sources and multiple receivers and by having intermediate nodes perform network coding operations. Our main idea behind using network coding is to introduce topologydependent correlation, which can be exploited at the receivers to infer the topology. We explored this idea in [33] for trees. We also combined network coding and tomographic techniques to infer the topology of a Directed Acyclic Graph (DAG), under specific routing assumptions, in [34]. The supporting idea in [34] was to decompose a traditional (i.e., without network coding) multiple source, multiple receiver tomography problem into multiple two source, two receiver subproblems, as shown in [12]. In this paper, we unify and extend our two previous pieces of work. Our main contribution is that when intermediate nodes perform network coding, topological information contained in network coded packets allows to uniquely identify a tree topology, or to accurately distinguish among all different 2-by-2 subnetwork components in a general DAG; this knowledge can then be used to merge the subnetworks and reconstruct the general topology. Our approach is applicable to any general Internet-like topology, and is robust to the presence of delay variability and packet loss.},
 type={4},
 author = {Sattari, P. and Markopoulou, Athina and Fragouli, C.},
 journal = {N/A},
 tags = {network_coding},
 title = {Inferring {Logical} {Topologies} using {Network} {Coding}},
 year = {2010}
}



@inproceedings{sattari_maximum_2011,
 type={4},
 author = {Sattari, P. and Markopoulou, Athina and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} on {Network} {Coding} ({NetCod})},
 tags = {network_coding},
 title = {Maximum likelihood estimation for multiple-source loss tomography with network coding},
 year = {2011}
}



@inproceedings{sattari_multiple_2009,
 abstract = {In this paper, we combine network coding and tomographic techniques for topology inference. Our goal is to infer the topology of a network by sending probes between a given set of multiple sources and multiple receivers and by having intermediate nodes perform network coding operations. We combine and extend two ideas that have been developed independently. On one hand, network coding introduces topology-dependent correlation, which can then be exploited at the receivers to infer the topology. On the other hand, it has been shown that a traditional (i.e., without network coding) multiple source, multiple receiver tomography problem can be decomposed into multiple two source, two receiver subproblems. Our first contribution is to show that, when intermediate nodes perform network coding, topological information contained in network coded packets allows to accurately distinguish among all different 2-by-2 subnetwork components, which was not possible with traditional tomographic techniques. Our second contribution is to use this knowledge to merge the subnetworks and accurately reconstruct the general topology. Our approach is applicable to any general Internet-like topology, and is robust to the presence of delay variability and packet loss.},
 type={4},
 author = {Sattari, P. and Markopoulou, Athina and Fragouli, C.},
 booktitle = {Network {Coding}, {Theory}, and {Applications}, 2009. {NetCod} '09. {Workshop} on},
 doi = {10.1109/netcod.2009.5191391},
 keywords = {network coding, encoding, multiple source multiple destination topology inference, network coded packets, network topology, receivers, routing protocols, telecommunication network topologycorrelation, tomographic techniques},
 month = {June},
 pages = {36--41},
 tags = {network_coding},
 title = {Multiple source multiple destination topology inference using network coding},
 year = {2009}
}



@inproceedings{seferoglu_smartcast_2011,
 abstract = {Video applications are increasingly popular over smartphones. However, in current cellular systems, the downlink data rate fluctuates and the loss rate can be quite high. We are interested in the scenario where a group of smartphone users, within proximity of each other, are interested in viewing the same video at the same time and are also willing to cooperate with each other. We propose a system that maximizes the video quality by appropriately using all available resources, namely the cellular connections to the phones as well as the device-to-device links that can be established via Bluetooth or WiFi. Key ingredients of our design are: (i) the cooperation among users, (ii) network coding, and (iii) exploiting broadcast in the mobile-to-mobile links. Our approach is grounded on a network utility maximization formulation of the problem. We present numerical results that demonstrate the benefit of our approach, and we implement a prototype on android phones.},
 type={4},
 author = {Seferoglu, H. and Keller, L. and Markopoulou, Athina and Fragouli, C.},
 booktitle = {{IEEE} {Allerton} {Conference} on {Communications}, {Control} and {Computing}},
 tags = {wireless,network_coding},
 title = {{SmartCast}: {Cooperative} video streaming on smartphones},
 year = {2011}
}



@article{sengupta_cooperative_2014,
 type={2},
 author = {Sengupta, A. and Wang, I. -Hsiang and Fragouli, C.},
 journal = {IEEE Transactions on Wireless Communications},
 tags = {wireless},
 title = {Cooperative relaying at finite {SNR}–role of {Quantize}-{Map}-and-{Forward}},
 year = {2014}
}



@inproceedings{sengupta_efficient_2014,
 type={4},
 author = {Sengupta, A. and Brahma, S. and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 tags = {wireless},
 title = {Efficient subnetwork selection in relay networks},
 year = {2014}
}



@inproceedings{sengupta_graph-based_2011,
 type={4},
 author = {Sengupta, A. and Brahma, S. and Ozgur, A. and Fragouli, C. and Diggavi, S.},
 booktitle = {Information {Theory} {Workshop} ({ITW}), 2011 {IEEE}},
 pages = {140--144},
 publisher = {IEEE},
 tags = {wireless},
 title = {Graph-based codes for {Quantize}-{Map}-and-{Forward} relaying},
 year = {2011}
}



@inproceedings{sengupta_optimizing_2012,
 abstract = {Quantize-Map-and-Forward (QMF) relaying has been shown to achieve the optimal diversity-multiplexing trade-off (DMT) for the slow fading single-antenna relay channel, regardless of whether the relay is full-duplex or half-duplex. A key reason for the DMT optimality is that quantizing at the noise level suffices to achieve the cut-set bound approximately and hence the relay does not need any instantaneous channel state information (CSI). However, DMT only captures the high SNR performance and potentially, limited CSI at the relay can help improve the performance in moderate SNR regimes. In this work we propose an optimization framework for QMF relaying in slow fading relay channels. Focusing on vector Gaussian quantizers, for the full-duplex relay we optimize the outage probability by finding the best quantization level according to the available CSI at the relay and the channel statistics. For the half-duplex relay we find good relay schedules using the same framework. Numerical evaluations show the improvement of taking the CSI into account over noise-level quantization and static schedules in moderate SNR regimes.},
 address = {New York},
 type={4},
 author = {Sengupta, Ayan and Wang, I. -Hsiang and Fragouli, C.},
 booktitle = {2012 {50Th} {Annual} {Allerton} {Conference} {On} {Communication}, {Control}, {And} {Computing} ({Allerton})},
 isbn = {978-1-4673-4539-2},
 pages = {1928--1934},
 publisher = {Ieee},
 tags = {wireless},
 title = {Optimizing {Quantize}-{Map}-and-{Forward} in {Slow} {Fading} {Relay} {Networks}},
 year = {2012}
}



@inproceedings{siavoshani_multi-terminal_2012,
 type={4},
 author = {Siavoshani, M. J. and Fragouli, C.},
 booktitle = {Network {Coding} ({NetCod}), 2012 {International} {Symposium} on},
 pages = {85--90},
 publisher = {IEEE},
 tags = {network_coding,wireless},
 title = {Multi-terminal secrecy in a linear non-coherent packetized networks},
 year = {2012}
}



@article{siavoshani_subspace_2012,
 type={2},
 author = {Siavoshani, M. J. and Fragouli, C. and Diggavi, S. N.},
 journal = {Information Theory, IEEE Transactions on},
 note = {Publisher: IEEE},
 number = {5},
 pages = {2599--2619},
 tags = {network_coding},
 title = {Subspace properties of network coding and their applications},
 volume = {58},
 year = {2012}
}



@article{sivaraman_controlled_1998,
 abstract = {A key problem in transporting multimedia traffic across wireless networks is a controlled sharing of the wireless link by different packet streams. So far this problem has been treated as that of providing support for quality of service in time division multiplexing based medium access control protocols (MAC). Adopting a different perspective to the problem, this paper describes an approach based on extending the class-based queueing (CBQ) based controlled hierarchical link sharing model proposed for the Internet. Our scheme enhances CBQ, which works well in wired links such as point-to-point wires of fixed bandwidth, to also work well with wireless links based on radio channels that are (i) inherently shared on-demand among multiple radios, and (ii) are subject to highly dynamic bandwidth variations due to spatially and temporally varying fading with accompanying burst errors. The proposed scheme is based on combining a modified version of CBQ with channel-state dependent packet scheduling.},
 type={4},
 author = {Sivaraman, V. and Srivastava, M. B. and Fragouli, C.},
 doi = {10.1109/INFCOM.1998.665077},
 journal = {Infocom},
 pages = {pages 572--580},
 tags = {wireless},
 title = {Controlled multimedia wireless link sharing via enhanced class-based queuing with channel-state-dependent packet scheduling},
 volume = {vol. 2},
 year = {1998}
}



@inproceedings{song_benefit_2017,
 type={4},
 author = {Song, L. and Srinivasavaradhan, SR and Fragouli, C.},
 booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},
 tags = {network_coding},
 title = {The {Benefit} of {Being} {Flexible} in {Distributed} {Computation}},
 year = {2017}
}



@inproceedings{song_content-type_2015,
 type={4},
 author = {Song, L. and Fragouli, C.},
 booktitle = {{IEEE} {Symposium} on {Network} {Coding} ({NetCod})},
 month = {July},
 tags = {network_coding},
 title = {Content-type coding},
 year = {2015}
}



@inproceedings{song_deterministic_2016,
 type={4},
 author = {Song, L. and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 tags = {network_coding},
 title = {A {Deterministic} {Algorithm} for {Pliable} {Index} {Coding}},
 year = {2016}
}




@inproceedings{song_making_2017,
 type={4},
 author = {Song, L. and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 tags = {network_coding},
 title = {Making recommendations bandwidth aware},
 year = {2017}
}



@inproceedings{song_making_2018,
 type={2},
 author = {Song, L. and Fragouli, C.},
 booktitle = {{IEEE} {Transactions} on {Information} {Theory}},
 tags = {network_coding},
 title = {Making recommendations bandwidth aware},
 year = {2018}
}



@inproceedings{song_pliable_2017,
 type={4},
 author = {Song, L. and Fragouli, C.},
 booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},
 tags = {network_coding},
 title = {A pliable index coding approach to data shuffling},
 year = {2017}
}





@inproceedings{song_polynomial-time_2018,
 type={2},
 author = {Song, L. and Fragouli, C.},
 booktitle = {{IEEE} {Transactions} on {Information} {Theory}},
 tags = {network_coding},
 title = {A polynomial-time algorithm for pliable index coding},
 year = {2018}
}




@article{srinivasavaradhan_equivalence_2020,
 type={4},
 author = {Srinivasavaradhan, SR and Fragouli, C. and Diggavi, S. N.},
 journal = {IEEE Symposium on Information Theory},
 tags = {channel_coding, bio},
 title = {Equivalence of {ML} decoding to a continuous optimization problem},
 year = {2020}
}




@article{srinivasavaradhan_symbolwise_2019,
 type={4},
 author = {Srinivasavaradhan, SR and Du, Michelle and Diggavi, Suhas and Fragouli, C.},
 journal = {IEEE International Symposium of Information Theory (ISIT)},
 tags = {channel_coding, bio},
 title = {Symbolwise {MAP} for {Multiple} {Deletion} {Channels}},
 year = {2019}
}



@inproceedings{tsai_distortion_2017,
 type={4},
 author = {Tsai, CY and Agarwal, G. K. and Fragouli, C. and Diggavi, S.},
 booktitle = {{IEEE} {International} {Symposium} of {Information} {Theory} ({ISIT})},
 month = {January},
 tags = {security},
 title = {A {Distortion} {Based} {Approach} for {Protecting} {Inferences}},
 year = {2017}
}



@article{tuninetti_processing_2004,
 abstract = {We consider a source that transmits to a receiver by routing the information packets over a communication network and examine rate benefits that finite complexity processing at the intermediate nodes may offer. We show that the processing capabilities of the intermediate nodes affect not only the end-to-end achievable rate, but also the optimal routing strategy. For example, there exist network configurations where the maximal throughput is achieved only by coding across independent information streams.},
 type={4},
 author = {Tuninetti, D. and Fragouli, C.},
 journal = {ISITA, Parma},
 tags = {network_coding},
 title = {Processing along the way: forwarding vs. coding},
 year = {2004}
}



@article{tuninetti_throughput_2005,
 abstract = {We consider a source that transmits information to a receiver by routing it over a communication network represented by a graph and examine rate benefits that finite complexity processing at the intermediate nodes may offer. We show that there exist configurations where the optimal rate is achieved only when coding across independent information streams (channel coding and routing cannot be separated); that optimal processing is a function of the particular set of channel parameters and not only of the network topology; and that there exists a connection between linear codes and routing for a special class of graphs.},
 type={4},
 author = {Tuninetti, D. and Fragouli, C.},
 journal = {ISIT},
 tags = {network_coding},
 title = {On the throughput improvement due to limited complexity processing at relay nodes},
 year = {2005}
}



@article{venkatesan_effect_2010,
 abstract = {Replication is a widely used method to protect largescale data storage systems from data loss when storage nodes fail. It is well known that the placement of replicas of the different data blocks across the nodes affects the time to rebuild. Several systems described in the literature are designed based on the premise that minimizing the rebuild times maximizes the system reliability. Our results however indicate that the reliability is essentially unaffected by the replica placement scheme. We show that, for a replication factor of two, all possible placement schemes have mean times to data loss (MTTDLs) within a factor of two for practical values of the failure rate, storage capacity, and rebuild bandwidth of a storage node. The theoretical results are confirmed by means of event-driven simulation. For higher replication factors, an analytical derivation of MTTDL becomes intractable for a general placement scheme. We therefore use one of the alternate measures of reliability that have been proposed in the literature, namely, the probability of data loss during rebuild in the critical mode of the system. Whereas for a replication factor of two this measure can be directly translated into MTTDL, it is only speculative of the MTTDL behavior for higher replication factors. This measure of reliability is shown to lie within a factor of two for all possible placement schemes and any replication factor. We also show that for any replication factor, the clustered placement scheme has the lowest probability of data loss during rebuild in critical mode among all possible placement schemes, whereas the declustered placement scheme has the highest probability. Simulation results reveal however that these properties do not hold for the corresponding MTTDLs for a replication factor greater than two. This indicates that some alternate measures of reliability may not be appropriate for comparing the MTTDL of different placement schemes.},
 type={4},
 author = {Venkatesan, Vinodh and Iliadis, Ilias and Hu, Xiao-Yu and Haas, Robert and Fragouli, C.},
 journal = {Modeling, Analysis, and Simulation of Computer Systems, International Symposium on},
 pages = {79--88},
 tags = {storage},
 title = {Effect of {Replica} {Placement} on the {Reliability} of {Large}-{Scale} {Data} {Storage} {Systems}},
 volume = {0},
 year = {2010}
}



@inproceedings{venkatesan_reliability_2011,
 type={4},
 author = {Venkatesan, Vinodh and Iliadis, Ilias and Fragouli, C. and Urbanke, R.},
 booktitle = {{IEEE} {International} {Symposium} on {Modeling}, {Analysis} and {Simulation} of {Computer} and {Telecommunication} {Systems} ({MASCOTS})},
 month = {August},
 tags = {storage},
 title = {Reliability of clustered vs. declustered replica placement in data storage systems},
 year = {2011}
}



@article{widmer_low-complexity_2005,
 abstract = {Energy efficiency, i.e., the amount of battery energy consumed to transmit bits across a wireless link, is a critical design parameter for wireless ad-hoc networks. This paper examines the problem of broadcasting information to all nodes in an ad-hoc network, when a large percentage of the nodes act as sources. For this application, we theoretically quantify the energy savings that network coding can offer in the cases of a line network and a rectangular grid network. We then propose low-complexity distributed algorithms, and demonstrate through simulation that in practice, for random networks, network coding can in fact offer significant benefits in terms of energy consumption.},
 type={4},
 author = {Widmer, J. and Fragouli, C. and Le Boudec, J.-Y.},
 journal = {1st Network Coding Workshop},
 tags = {network_coding,wireless},
 title = {Low-complexity energy-efficient broadcasting in wireless ad-hoc networks using network coding},
 year = {2005}
}

\">\n            <i class=\"fa fa-download fa-fw\"></i> Download BibTeX\n          </a>\n        </li>\n        <li>\n          <a href=\"//bibbase.org/rss?bib=https://bibbase.org/network/files/52xaJNXvSgauGDmZR\">\n            <i class=\"fa fa-rss fa-fw\"></i> RSS Feed\n          </a>\n          </li>\n      </ul>\n      </li>\n\n      \n\n\n      \n    </ul>\n\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_embed\"\n         style=\"display: none;\">\n\n      Excellent! Next you can\n      <a href=\"/network/register?next=/network/newSiteFromTemplate%3Fbiburl=https://bibbase.org/network/files/52xaJNXvSgauGDmZR\"\n      >create a new website with this list</a>, or\n      embed it in an existing web page by copying &amp; pasting\n      any of the following snippets.\n\n      <div style=\"text-align: left; margin-top: 1em;\">\n        <strong>JavaScript</strong>\n        <span class=\"comment recommended\">(easiest)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&amp;noBootstrap=1&amp;authorFirst=1&amp;nocache=1&amp;fullnames=1&amp;theme=bullets&amp;group0=year&amp;group1=type&amp;owner={}&amp;jsonp=1&amp;jsonp=1\"&gt;&lt;/script&gt;\n          </code>\n        </div>\n\n        <strong>PHP</strong>\n        <div class=\"well well-small\">\n          <code>\n            &lt;?php\n            $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&amp;noBootstrap=1&amp;authorFirst=1&amp;nocache=1&amp;fullnames=1&amp;theme=bullets&amp;group0=year&amp;group1=type&amp;owner={}&amp;jsonp=1\");\n            print_r($contents);\n            ?&gt;\n          </code>\n        </div>\n\n        <strong>iFrame</strong>\n        <span class=\"comment\">(not recommended)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&amp;noBootstrap=1&amp;authorFirst=1&amp;nocache=1&amp;fullnames=1&amp;theme=bullets&amp;group0=year&amp;group1=type&amp;owner={}&amp;jsonp=1\"&gt;&lt;/iframe&gt;\n          </code>\n        </div>\n\n        <p>\n          For more details see the <a href=\"//bibbase.org/help\">documention</a>.\n        </p>\n      </div>\n    </div>\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_preview\"\n         style=\"display: none;\">\n\n      This is a preview! To use this list on your own web site\n      or create a new web site from it,\n      <a href=\"/network/register?next=/network/newAccountWithFile%3FfileId=\"\n      >create a free account</a>. The file will be added\n      and you will be able to edit it in the File Manager.\n      We will show you instructions once you've created your account.\n    </div>\n\n    <div class=\"alert alert-warning bibbase_msg\" id=\"bibbase_msg_mendeley1\"\n         style=\"display: none;\">\n\n      <p>To the site owner:</p>\n\n      <p><strong>Action required!</strong> Mendeley is changing its\n        API. In order to keep using Mendeley with BibBase past April\n        14th, you need to:\n        <ol>\n          <li>renew the authorization for BibBase on Mendeley, and</li>\n          <li>update the BibBase URL\n            in your page the same way you did when you initially set up\n            this page.\n          </li>\n        </ol>\n      </p>\n\n      <p>\n        <a href=\"http://bibbase.org/cgi-bin/mendeley2/get.py\">\n          <i class=\"fa fa-angle-double-right\"></i>\n          Fix it now</a>\n      </p>\n    </div>\n\n  </div>\n\n\n  <div id=\"bibbase_body\">\n    \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2023\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2023')\"\n      onkeypress=\"toggleGroup('group_2023')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2023</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"yao-nikolopoulos-fragouli-adiagonalsplittingalgorithmforadaptivegrouptesting-2023\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Chaorui Yao;  Pavlos Nikolopoulos;  and  Christina Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Diagonal Splitting Algorithm for Adaptive Group Testing.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>2023 IEEE International Symposium on Information Theory (ISIT)</i>, pages 1842–1847,  2023. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ISIT54713.2023.10206936\"\n     onclick=\"log_download('yao-nikolopoulos-fragouli-adiagonalsplittingalgorithmforadaptivegrouptesting-2023', 'http://doi.org/10.1109/ISIT54713.2023.10206936', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/yao-nikolopoulos-fragouli-adiagonalsplittingalgorithmforadaptivegrouptesting-2023\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('yao-nikolopoulos-fragouli-adiagonalsplittingalgorithmforadaptivegrouptesting-2023')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{yao2023diagonal,\n  type={4},\n  tags={chaorui,pavlos},\n  title={A Diagonal Splitting Algorithm for Adaptive Group Testing},\n  author={Yao, Chaorui and Nikolopoulos, Pavlos and Fragouli, Christina},\n  booktitle={2023 IEEE International Symposium on Information Theory (ISIT)},\n  pages={1842--1847},\n  year={2023},\n  organization={IEEE},\n  doi={10.1109/ISIT54713.2023.10206936}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hanna-li-diggavi-fragouli-commoninformationdimension-2023\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Osama A Hanna;  Xinlin Li;  Suhas Diggavi;  and  Christina Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Common information dimension.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>2023 IEEE International Symposium on Information Theory (ISIT)</i>, pages 406–411,  2023. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hanna-li-diggavi-fragouli-commoninformationdimension-2023\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hanna-li-diggavi-fragouli-commoninformationdimension-2023')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{hanna2023common,\n  type={4},\n  tags={xinlin,osama},\n  title={Common information dimension},\n  author={Hanna, Osama A and Li, Xinlin and Diggavi, Suhas and Fragouli, Christina},\n  booktitle={2023 IEEE International Symposium on Information Theory (ISIT)},\n  pages={406--411},\n  year={2023},\n  organization={IEEE}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hanna-karakas-yang-fragouli-multiarmbanditsoveractionerasurechannels-2023\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Osama A Hanna;  Merve Karakas;  Lin F Yang;  and  Christina Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Multi-Arm Bandits over Action Erasure Channels.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>2023 IEEE International Symposium on Information Theory (ISIT)</i>, pages 1312–1317,  2023. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hanna-karakas-yang-fragouli-multiarmbanditsoveractionerasurechannels-2023\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hanna-karakas-yang-fragouli-multiarmbanditsoveractionerasurechannels-2023')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{hanna2023multi,\n  type={4},\n  tags={merve,osama},\n  title={Multi-Arm Bandits over Action Erasure Channels},\n  author={Hanna, Osama A and Karakas, Merve and Yang, Lin F and Fragouli, Christina},\n  booktitle={2023 IEEE International Symposium on Information Theory (ISIT)},\n  pages={1312--1317},\n  year={2023},\n  organization={IEEE}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_article\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_article')\"\n      onkeypress=\"toggleGroup('group_article')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>article</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"hanna-yang-fragouli-compressionformultiarmbandits-2023\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Osama A Hanna;  Lin F Yang;  and  Christina Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Compression for Multi-Arm Bandits.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Journal on Selected Areas in Information Theory</i>.  2023.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hanna-yang-fragouli-compressionformultiarmbandits-2023\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hanna-yang-fragouli-compressionformultiarmbandits-2023')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{hanna2023compression,\n  tags={osama},\n  title={Compression for Multi-Arm Bandits},\n  author={Hanna, Osama A and Yang, Lin F and Fragouli, Christina},\n  journal={IEEE Journal on Selected Areas in Information Theory},\n  year={2023},\n  publisher={IEEE}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hanna-yang-fragouli-efficientbatchedalgorithmsforcontextuallinearbanditswithlargeactionspaceviasoftelimination-2023\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Osama Hanna;  Lin Yang;  and  Christina Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Efficient Batched Algorithms for Contextual Linear Bandits with Large Action Space via Soft Elimination.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Advances in Neural Information Processing Systems</i>.  2023.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hanna-yang-fragouli-efficientbatchedalgorithmsforcontextuallinearbanditswithlargeactionspaceviasoftelimination-2023\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hanna-yang-fragouli-efficientbatchedalgorithmsforcontextuallinearbanditswithlargeactionspaceviasoftelimination-2023')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{hanna2023efficient,\n  tags={osama},\n  title={Efficient Batched Algorithms for Contextual Linear Bandits with Large Action Space via Soft Elimination},\n  author={Hanna, Osama and Yang, Lin and Fragouli, Christina},\n  journal={Advances in Neural Information Processing Systems},\n  volume={},\n  pages={},\n  year={2023}\n}\n\n\n\n% Updated by Xinlin @ 2022-Aug.\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_inproceedings\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_inproceedings')\"\n      onkeypress=\"toggleGroup('group_inproceedings')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>inproceedings</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"hanna-yang-fragouli-contextscanbecheapsolvingstochasticcontextualbanditswithlinearbanditalgorithms-2023\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Osama A Hanna;  Lin Yang;  and  Christina Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Contexts can be cheap: Solving stochastic contextual bandits with linear bandit algorithms.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>The Thirty Sixth Annual Conference on Learning Theory</i>, pages 1791–1821,  2023. PMLR\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hanna-yang-fragouli-contextscanbecheapsolvingstochasticcontextualbanditswithlinearbanditalgorithms-2023\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hanna-yang-fragouli-contextscanbecheapsolvingstochasticcontextualbanditswithlinearbanditalgorithms-2023')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{hanna2023contexts,\n  tags={osama},\n  title={Contexts can be cheap: Solving stochastic contextual bandits with linear bandit algorithms},\n  author={Hanna, Osama A and Yang, Lin and Fragouli, Christina},\n  booktitle={The Thirty Sixth Annual Conference on Learning Theory},\n  pages={1791--1821},\n  year={2023},\n  organization={PMLR}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2022\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2022')\"\n      onkeypress=\"toggleGroup('group_2022')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2022</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"dogan-ezzeldin-fragouli-gomoryhutreesoverwireless-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Mine Gokce Dogan;  Yahya H Ezzeldin;  and  Christina Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Gomory-hu trees over wireless.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Communications Letters</i>, 26(5): 1004–1007.  2022.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dogan-ezzeldin-fragouli-gomoryhutreesoverwireless-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dogan-ezzeldin-fragouli-gomoryhutreesoverwireless-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{dogan2022gomory,\n  type={2},\n  tags={na,mine},\n  title={Gomory-hu trees over wireless},\n  author={Dogan, Mine Gokce and Ezzeldin, Yahya H and Fragouli, Christina},\n  journal={IEEE Communications Letters},\n  volume={26},\n  number={5},\n  pages={1004--1007},\n  year={2022},\n  publisher={IEEE}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (5)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"dogan-cardone-fragouli-proactiveresiliencein121networks-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Mine Gokce Dogan;  Martina Cardone;  and  Christina Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Proactive Resilience in 1-2-1 Networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>2022 IEEE International Symposium on Information Theory (ISIT)</i>, pages 3220-3225,  2022. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ISIT50566.2022.9834416\"\n     onclick=\"log_download('dogan-cardone-fragouli-proactiveresiliencein121networks-2022', 'http://doi.org/10.1109/ISIT50566.2022.9834416', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dogan-cardone-fragouli-proactiveresiliencein121networks-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dogan-cardone-fragouli-proactiveresiliencein121networks-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@INPROCEEDINGS{9834416,\n  type={4},\n  tags={wireless,mine},\n  author={Dogan, Mine Gokce and Cardone, Martina and Fragouli, Christina},\n  booktitle={2022 IEEE International Symposium on Information Theory (ISIT)}, \n  title={Proactive Resilience in 1-2-1 Networks}, \n  year={2022},\n  volume={},\n  number={},\n  pages={3220-3225},\n  doi={10.1109/ISIT50566.2022.9834416}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"srinivasavaradhan-nikolopoulos-fragouli-diggavi-improvinggrouptestingviagradientdescent-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Sundara Rajan Srinivasavaradhan;  Pavlos Nikolopoulos;  Christina Fragouli;  and  Suhas Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Improving Group Testing via Gradient Descent.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>2022 IEEE International Symposium on Information Theory (ISIT)</i>, pages 2243-2248,  2022. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ISIT50566.2022.9834577\"\n     onclick=\"log_download('srinivasavaradhan-nikolopoulos-fragouli-diggavi-improvinggrouptestingviagradientdescent-2022', 'http://doi.org/10.1109/ISIT50566.2022.9834577', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/srinivasavaradhan-nikolopoulos-fragouli-diggavi-improvinggrouptestingviagradientdescent-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>10 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('srinivasavaradhan-nikolopoulos-fragouli-diggavi-improvinggrouptestingviagradientdescent-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@INPROCEEDINGS{9834577,\n  type={4},\n  tags={group_testing,pavlos},\n  author={Srinivasavaradhan, Sundara Rajan and Nikolopoulos, Pavlos and Fragouli, Christina and Diggavi, Suhas},\n  booktitle={2022 IEEE International Symposium on Information Theory (ISIT)}, \n  title={Improving Group Testing via Gradient Descent}, \n  year={2022},\n  volume={},\n  number={},\n  pages={2243-2248},\n  doi={10.1109/ISIT50566.2022.9834577}}\n\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hanna-li-fragouli-diggavi-canwebreakthedependencyindistributeddetection-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Osama A. Hanna;  Xinlin Li;  Christina Fragouli;  and  Suhas Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Can we break the dependency in distributed detection?.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>2022 IEEE International Symposium on Information Theory (ISIT)</i>, pages 2720-2725,  2022. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ISIT50566.2022.9834790\"\n     onclick=\"log_download('hanna-li-fragouli-diggavi-canwebreakthedependencyindistributeddetection-2022', 'http://doi.org/10.1109/ISIT50566.2022.9834790', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hanna-li-fragouli-diggavi-canwebreakthedependencyindistributeddetection-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>7 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hanna-li-fragouli-diggavi-canwebreakthedependencyindistributeddetection-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@INPROCEEDINGS{9834790,\n  type={4},\n  tags={ML_CC,osama,xinlin},\n  author={Hanna, Osama A. and Li, Xinlin and Fragouli, Christina and Diggavi, Suhas},\n  booktitle={2022 IEEE International Symposium on Information Theory (ISIT)}, \n  title={Can we break the dependency in distributed detection?}, \n  year={2022},\n  volume={},\n  number={},\n  pages={2720-2725},\n  doi={10.1109/ISIT50566.2022.9834790}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"srinivasavaradhan-nikolopoulos-fragouli-diggavi-dynamicgrouptestingtocontrolandmonitordiseaseprogressioninapopulation-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Sundara Rajan Srinivasavaradhan;  Pavlos Nikolopoulos;  Christina Fragouli;  and  Suhas Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Dynamic group testing to control and monitor disease progression in a population.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>2022 IEEE International Symposium on Information Theory (ISIT)</i>, pages 2255-2260,  2022. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ISIT50566.2022.9834823\"\n     onclick=\"log_download('srinivasavaradhan-nikolopoulos-fragouli-diggavi-dynamicgrouptestingtocontrolandmonitordiseaseprogressioninapopulation-2022', 'http://doi.org/10.1109/ISIT50566.2022.9834823', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/srinivasavaradhan-nikolopoulos-fragouli-diggavi-dynamicgrouptestingtocontrolandmonitordiseaseprogressioninapopulation-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('srinivasavaradhan-nikolopoulos-fragouli-diggavi-dynamicgrouptestingtocontrolandmonitordiseaseprogressioninapopulation-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@INPROCEEDINGS{9834823,\n  type={4},\n  tags = {group_testing,pavlos},\n  author={Srinivasavaradhan, Sundara Rajan and Nikolopoulos, Pavlos and Fragouli, Christina and Diggavi, Suhas},\n  booktitle={2022 IEEE International Symposium on Information Theory (ISIT)}, \n  title={Dynamic group testing to control and monitor disease progression in a population}, \n  year={2022},\n  volume={},\n  number={},\n  pages={2255-2260},\n  doi={10.1109/ISIT50566.2022.9834823}}\n\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hanna-yang-fragouli-solvingmultiarmbanditusingafewbitsofcommunication-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Osama A. Hanna;  Lin F. Yang;  and  Christina Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Solving Multi-Arm Bandit Using a Few Bits of Communication.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>International Conference on Artificial Intelligence and Statistics</i>, pages 3220-3225,  2022. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hanna-yang-fragouli-solvingmultiarmbanditusingafewbitsofcommunication-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hanna-yang-fragouli-solvingmultiarmbanditusingafewbitsofcommunication-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@INPROCEEDINGS{Hanna2022SolvingMB,\n  type={4},\n  tags={ML_CC,osama},\n  author={Osama A. Hanna and Lin F. Yang and Christina Fragouli},\n  booktitle={International Conference on Artificial Intelligence and Statistics}, \n  title={Solving Multi-Arm Bandit Using a Few Bits of Communication},\n  year={2022},\n  pages={3220-3225}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_article\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_article')\"\n      onkeypress=\"toggleGroup('group_article')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>article</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"hanna-yang-fragouli-learningindistributedcontextuallinearbanditswithoutsharingthecontext-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Osama A Hanna;  Lin F Yang;  and  Christina Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Learning in distributed contextual linear bandits without sharing the context.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>arXiv preprint arXiv:2206.04180</i>.  2022.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hanna-yang-fragouli-learningindistributedcontextuallinearbanditswithoutsharingthecontext-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hanna-yang-fragouli-learningindistributedcontextuallinearbanditswithoutsharingthecontext-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{hanna2022learning,\n  tags={osama},\n  title={Learning in distributed contextual linear bandits without sharing the context},\n  author={Hanna, Osama A and Yang, Lin F and Fragouli, Christina},\n  journal={arXiv preprint arXiv:2206.04180},\n  year={2022}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hanna-yang-fragouli-learningfromdistributedusersincontextuallinearbanditswithoutsharingthecontext-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Osama Hanna;  Lin Yang;  and  Christina Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Learning from Distributed Users in Contextual Linear Bandits Without Sharing the Context.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Advances in Neural Information Processing Systems</i>, 35: 11049–11062.  2022.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hanna-yang-fragouli-learningfromdistributedusersincontextuallinearbanditswithoutsharingthecontext-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hanna-yang-fragouli-learningfromdistributedusersincontextuallinearbanditswithoutsharingthecontext-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{hanna2022learning2,\n  tags={osama},\n  title={Learning from Distributed Users in Contextual Linear Bandits Without Sharing the Context},\n  author={Hanna, Osama and Yang, Lin and Fragouli, Christina},\n  journal={Advances in Neural Information Processing Systems},\n  volume={35},\n  pages={11049--11062},\n  year={2022}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hanna-girgis-fragouli-diggavi-differentiallyprivatestochasticlinearbanditsalmostforfree-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Osama A Hanna;  Antonious M Girgis;  Christina Fragouli;  and  Suhas Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Differentially private stochastic linear bandits:(almost) for free.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>arXiv preprint arXiv:2207.03445</i>.  2022.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hanna-girgis-fragouli-diggavi-differentiallyprivatestochasticlinearbanditsalmostforfree-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>11 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hanna-girgis-fragouli-diggavi-differentiallyprivatestochasticlinearbanditsalmostforfree-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{hanna2022differentially,\n  tags={osama},\n  title={Differentially private stochastic linear bandits:(almost) for free},\n  author={Hanna, Osama A and Girgis, Antonious M and Fragouli, Christina and Diggavi, Suhas},\n  journal={arXiv preprint arXiv:2207.03445},\n  year={2022}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2021\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2021')\"\n      onkeypress=\"toggleGroup('group_2021')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2021</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (7)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"mao-diggavi-fragouli-tabuada-securestatereconstructionovernetworkssubjecttoattacks-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Yanwen Mao;  Suhas Diggavi;  Christina Fragouli;  and  Paulo Tabuada.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Secure State-Reconstruction Over Networks Subject to Attacks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Control Systems Letters</i>, 5(1): 157-162.  2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/LCSYS.2020.3000853\"\n     onclick=\"log_download('mao-diggavi-fragouli-tabuada-securestatereconstructionovernetworkssubjecttoattacks-2021', 'http://doi.org/10.1109/LCSYS.2020.3000853', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mao-diggavi-fragouli-tabuada-securestatereconstructionovernetworkssubjecttoattacks-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>3 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mao-diggavi-fragouli-tabuada-securestatereconstructionovernetworkssubjecttoattacks-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@ARTICLE{9112310,\n  type={2},\n  tags = {security},\n  author={Mao, Yanwen and Diggavi, Suhas and Fragouli, Christina and Tabuada, Paulo},\n  journal={IEEE Control Systems Letters}, \n  title={Secure State-Reconstruction Over Networks Subject to Attacks}, \n  year={2021},\n  volume={5},\n  number={1},\n  pages={157-162},\n  doi={10.1109/LCSYS.2020.3000853}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"agarwal-karmoose-diggavi-fragouli-tabuada-distortionbasedlightweightsecurityforcyberphysicalsystems-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Gaurav Kumar Agarwal;  Mohammed Karmoose;  Suhas Diggavi;  Christina Fragouli;  and  Paulo Tabuada.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Distortion-Based Lightweight Security for Cyber-Physical Systems.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Automatic Control</i>, 66(4): 1588-1601.  2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TAC.2020.3006814\"\n     onclick=\"log_download('agarwal-karmoose-diggavi-fragouli-tabuada-distortionbasedlightweightsecurityforcyberphysicalsystems-2021', 'http://doi.org/10.1109/TAC.2020.3006814', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/agarwal-karmoose-diggavi-fragouli-tabuada-distortionbasedlightweightsecurityforcyberphysicalsystems-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('agarwal-karmoose-diggavi-fragouli-tabuada-distortionbasedlightweightsecurityforcyberphysicalsystems-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@ARTICLE{9133260,\n  type={2},\n  tags = {security},\n  author={Agarwal, Gaurav Kumar and Karmoose, Mohammed and Diggavi, Suhas and Fragouli, Christina and Tabuada, Paulo},\n  journal={IEEE Transactions on Automatic Control}, \n  title={Distortion-Based Lightweight Security for Cyber-Physical Systems}, \n  year={2021},\n  volume={66},\n  number={4},\n  pages={1588-1601},\n  doi={10.1109/TAC.2020.3006814}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"srinivasavaradhan-du-diggavi-fragouli-algorithmsforreconstructionoversingleandmultipledeletionchannels-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Sundara Rajan Srinivasavaradhan;  Michelle Du;  Suhas N. Diggavi;  and  Christina Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Algorithms for Reconstruction Over Single and Multiple Deletion Channels.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 67(6): 3389-3410.  2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TIT.2020.3033513\"\n     onclick=\"log_download('srinivasavaradhan-du-diggavi-fragouli-algorithmsforreconstructionoversingleandmultipledeletionchannels-2021', 'http://doi.org/10.1109/TIT.2020.3033513', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/srinivasavaradhan-du-diggavi-fragouli-algorithmsforreconstructionoversingleandmultipledeletionchannels-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>5 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('srinivasavaradhan-du-diggavi-fragouli-algorithmsforreconstructionoversingleandmultipledeletionchannels-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@ARTICLE{9239329,\n  type={2},\n  tags = {bio,channel_coding},\n  author={Srinivasavaradhan, Sundara Rajan and Du, Michelle and Diggavi, Suhas N. and Fragouli, Christina},\n  journal={IEEE Transactions on Information Theory}, \n  title={Algorithms for Reconstruction Over Single and Multiple Deletion Channels}, \n  year={2021},\n  volume={67},\n  number={6},\n  pages={3389-3410},\n  doi={10.1109/TIT.2020.3033513}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ezzeldin-cardone-fragouli-caire-gaussian121networkscapacityresultsformmwavecommunications-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Yahya H. Ezzeldin;  Martina Cardone;  Christina Fragouli;  and  Giuseppe Caire.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Gaussian 1-2-1 Networks: Capacity Results for mmWave Communications.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 67(2): 961-990.  2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TIT.2020.3034569\"\n     onclick=\"log_download('ezzeldin-cardone-fragouli-caire-gaussian121networkscapacityresultsformmwavecommunications-2021', 'http://doi.org/10.1109/TIT.2020.3034569', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ezzeldin-cardone-fragouli-caire-gaussian121networkscapacityresultsformmwavecommunications-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ezzeldin-cardone-fragouli-caire-gaussian121networkscapacityresultsformmwavecommunications-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@ARTICLE{9244138,\n  type={2},\n  tags = {wireless},\n  author={Ezzeldin, Yahya H. and Cardone, Martina and Fragouli, Christina and Caire, Giuseppe},\n  journal={IEEE Transactions on Information Theory}, \n  title={Gaussian 1-2-1 Networks: Capacity Results for mmWave Communications}, \n  year={2021},\n  volume={67},\n  number={2},\n  pages={961-990},\n  doi={10.1109/TIT.2020.3034569}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"song-ezzeldin-caire-fragouli-efficientbeamschedulingforhalfduplexmmwaverelaynetworks-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Xiaoshen Song;  Yahya H. Ezzeldin;  Giuseppe Caire;  and  Christina Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Efficient Beam Scheduling for Half-Duplex mmWave Relay Networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Communications</i>, 69(9): 5773-5789.  2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TCOMM.2021.3087203\"\n     onclick=\"log_download('song-ezzeldin-caire-fragouli-efficientbeamschedulingforhalfduplexmmwaverelaynetworks-2021', 'http://doi.org/10.1109/TCOMM.2021.3087203', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/song-ezzeldin-caire-fragouli-efficientbeamschedulingforhalfduplexmmwaverelaynetworks-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('song-ezzeldin-caire-fragouli-efficientbeamschedulingforhalfduplexmmwaverelaynetworks-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@ARTICLE{9448027,\ntype={2},\n  author={Song, Xiaoshen and Ezzeldin, Yahya H. and Caire, Giuseppe and Fragouli, Christina},\n  journal={IEEE Transactions on Communications}, \n  title={Efficient Beam Scheduling for Half-Duplex mmWave Relay Networks}, \n  year={2021},\n  volume={69},\n  number={9},\n  tags = {wireless},\n  pages={5773-5789},\n  doi={10.1109/TCOMM.2021.3087203}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hanna-ezzeldin-fragouli-diggavi-quantizationofdistributeddataforlearning-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Osama A. Hanna;  Yahya H. Ezzeldin;  Christina Fragouli;  and  Suhas Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Quantization of Distributed Data for Learning.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Journal on Selected Areas in Information Theory</i>, 2(3): 987-1001.  2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/JSAIT.2021.3105359\"\n     onclick=\"log_download('hanna-ezzeldin-fragouli-diggavi-quantizationofdistributeddataforlearning-2021', 'http://doi.org/10.1109/JSAIT.2021.3105359', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hanna-ezzeldin-fragouli-diggavi-quantizationofdistributeddataforlearning-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>7 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hanna-ezzeldin-fragouli-diggavi-quantizationofdistributeddataforlearning-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@ARTICLE{9521982,\n  type={2},\n  tags={osama},\n  author={Hanna, Osama A. and Ezzeldin, Yahya H. and Fragouli, Christina and Diggavi, Suhas},\n  journal={IEEE Journal on Selected Areas in Information Theory}, \n  title={Quantization of Distributed Data for Learning}, \n  year={2021},\n  volume={2},\n  number={3},\n  pages={987-1001},\n  tags = {ML_CC},\n  doi={10.1109/JSAIT.2021.3105359}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"nikolopoulos-srinivasavaradhan-fragouli-diggavi-grouptestingforcommunityinfections-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Pavlos Nikolopoulos;  Sundara Rajan Srinivasavaradhan;  Christina Fragouli;  and  Suhas N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Group Testing for Community Infections.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE BITS the Information Theory Magazine</i>, 1(1): 57-68.  2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/MBITS.2021.3126244\"\n     onclick=\"log_download('nikolopoulos-srinivasavaradhan-fragouli-diggavi-grouptestingforcommunityinfections-2021', 'http://doi.org/10.1109/MBITS.2021.3126244', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/nikolopoulos-srinivasavaradhan-fragouli-diggavi-grouptestingforcommunityinfections-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>4 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('nikolopoulos-srinivasavaradhan-fragouli-diggavi-grouptestingforcommunityinfections-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@ARTICLE{9609622,\n  type={2},\n  tags={group_testing,pavlos},\n  author={Nikolopoulos, Pavlos and Srinivasavaradhan, Sundara Rajan and Fragouli, Christina and Diggavi, Suhas N.},\n  journal={IEEE BITS the Information Theory Magazine}, \n  title={Group Testing for Community Infections}, \n  year={2021},\n  volume={1},\n  number={1},\n  pages={57-68},\n  doi={10.1109/MBITS.2021.3126244}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (8)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"ezzeldin-cardone-fragouli-multilevelsecrecyover121networks-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Yahya H. Ezzeldin;  Martina Cardone;  and  Christina Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Multilevel Secrecy over 1-2-1 Networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>2020 IEEE Information Theory Workshop (ITW)</i>, pages 1-5,  2021. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ITW46852.2021.9457663\"\n     onclick=\"log_download('ezzeldin-cardone-fragouli-multilevelsecrecyover121networks-2021', 'http://doi.org/10.1109/ITW46852.2021.9457663', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ezzeldin-cardone-fragouli-multilevelsecrecyover121networks-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>4 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ezzeldin-cardone-fragouli-multilevelsecrecyover121networks-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@INPROCEEDINGS{9457663,\n  type={4},\n  author={Ezzeldin, Yahya H. and Cardone, Martina and Fragouli, Christina},\n  booktitle={2020 IEEE Information Theory Workshop (ITW)}, \n  title={Multilevel Secrecy over 1-2-1 Networks}, \n  year={2021},\n  volume={},\n  number={},\n  tags = {wireless,security},\n  pages={1-5},\n  doi={10.1109/ITW46852.2021.9457663}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"dogan-ezzeldin-fragouli-onoptimalrelayplacementindirectionalnetworks-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Mine Gokce Dogan;  Yahya H. Ezzeldin;  and  Christina Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On optimal relay placement in directional networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>2021 IEEE International Symposium on Information Theory (ISIT)</i>, pages 3156-3161,  2021. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ISIT45174.2021.9517757\"\n     onclick=\"log_download('dogan-ezzeldin-fragouli-onoptimalrelayplacementindirectionalnetworks-2021', 'http://doi.org/10.1109/ISIT45174.2021.9517757', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dogan-ezzeldin-fragouli-onoptimalrelayplacementindirectionalnetworks-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dogan-ezzeldin-fragouli-onoptimalrelayplacementindirectionalnetworks-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@INPROCEEDINGS{9517757,\n  type={4},\n  tags={wireless,mine},\n  author={Dogan, Mine Gokce and Ezzeldin, Yahya H. and Fragouli, Christina},\n  booktitle={2021 IEEE International Symposium on Information Theory (ISIT)}, \n  title={On optimal relay placement in directional networks}, \n  year={2021},\n  volume={},\n  number={},\n  pages={3156-3161},\n  doi={10.1109/ISIT45174.2021.9517757}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"srinivasavaradhan-nikolopoulos-fragouli-diggavi-anentropyreductionapproachtocontinualtesting-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Sundara Rajan Srinivasavaradhan;  Pavlos Nikolopoulos;  Christina Fragouli;  and  Suhas Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  An entropy reduction approach to continual testing.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>2021 IEEE International Symposium on Information Theory (ISIT)</i>, pages 611-616,  2021. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ISIT45174.2021.9518188\"\n     onclick=\"log_download('srinivasavaradhan-nikolopoulos-fragouli-diggavi-anentropyreductionapproachtocontinualtesting-2021', 'http://doi.org/10.1109/ISIT45174.2021.9518188', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/srinivasavaradhan-nikolopoulos-fragouli-diggavi-anentropyreductionapproachtocontinualtesting-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('srinivasavaradhan-nikolopoulos-fragouli-diggavi-anentropyreductionapproachtocontinualtesting-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@INPROCEEDINGS{9518188,\n  type={4},\n  tags={group_testing,pavlos},\n  author={Srinivasavaradhan, Sundara Rajan and Nikolopoulos, Pavlos and Fragouli, Christina and Diggavi, Suhas},\n  booktitle={2021 IEEE International Symposium on Information Theory (ISIT)}, \n  title={An entropy reduction approach to continual testing}, \n  year={2021},\n  volume={},\n  number={},\n  pages={611-616},\n  doi={10.1109/ISIT45174.2021.9518188}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"bunton-anevlavis-verma-fragouli-tabuada-splittowinnearoptimalsensornetworksynthesisviapathgreedysubproblems-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Jonathan Bunton;  Tzanis Anevlavis;  Gunjan Verma;  Christina Fragouli;  and  Paulo Tabuada.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Split to win: near-optimal sensor network synthesis via path-greedy subproblems.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)</i>, pages 789-794,  2021. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/MILCOM52596.2021.9652975\"\n     onclick=\"log_download('bunton-anevlavis-verma-fragouli-tabuada-splittowinnearoptimalsensornetworksynthesisviapathgreedysubproblems-2021', 'http://doi.org/10.1109/MILCOM52596.2021.9652975', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bunton-anevlavis-verma-fragouli-tabuada-splittowinnearoptimalsensornetworksynthesisviapathgreedysubproblems-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bunton-anevlavis-verma-fragouli-tabuada-splittowinnearoptimalsensornetworksynthesisviapathgreedysubproblems-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@INPROCEEDINGS{9652975,\n  type={4},\n  tags = {na},\n  author={Bunton, Jonathan and Anevlavis, Tzanis and Verma, Gunjan and Fragouli, Christina and Tabuada, Paulo},\n  booktitle={MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)}, \n  title={Split to win: near-optimal sensor network synthesis via path-greedy subproblems}, \n  year={2021},\n  volume={},\n  number={},\n  pages={789-794},\n  doi={10.1109/MILCOM52596.2021.9652975}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"dogan-ezzeldin-fragouli-bohannon-areinforcementlearningapproachforschedulinginmmwavenetworks-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Mine Gokce Dogan;  Yahya H. Ezzeldin;  Christina Fragouli;  and  Addison W. Bohannon.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Reinforcement Learning Approach for Scheduling in mmWave Networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)</i>, pages 771-776,  2021. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/MILCOM52596.2021.9653135\"\n     onclick=\"log_download('dogan-ezzeldin-fragouli-bohannon-areinforcementlearningapproachforschedulinginmmwavenetworks-2021', 'http://doi.org/10.1109/MILCOM52596.2021.9653135', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dogan-ezzeldin-fragouli-bohannon-areinforcementlearningapproachforschedulinginmmwavenetworks-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dogan-ezzeldin-fragouli-bohannon-areinforcementlearningapproachforschedulinginmmwavenetworks-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@INPROCEEDINGS{9653135,\n  type={4},\n  tags = {wireless,mine},\n  author={Dogan, Mine Gokce and Ezzeldin, Yahya H. and Fragouli, Christina and Bohannon, Addison W.},\n  booktitle={MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)}, \n  title={A Reinforcement Learning Approach for Scheduling in mmWave Networks}, \n  year={2021},\n  volume={},\n  number={},\n  pages={771-776},\n  doi={10.1109/MILCOM52596.2021.9653135}}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"nikolopoulos-rajansrinivasavaradhan-guo-fragouli-diggavi-grouptestingforconnectedcommunities-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Pavlos Nikolopoulos;  Sundara Rajan Srinivasavaradhan;  Tao Guo;  Christina Fragouli;  and  Suhas Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://proceedings.mlr.press/v130/nikolopoulos21a.html\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'nikolopoulos-rajansrinivasavaradhan-guo-fragouli-diggavi-grouptestingforconnectedcommunities-2021', 'https://proceedings.mlr.press/v130/nikolopoulos21a.html', event);\">\n    Group testing for connected communities .\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In  Arindam Banerjee;  and  Kenji Fukumizu., editor(s), <i>Proceedings of The 24th International Conference on Artificial Intelligence and Statistics</i>, volume 130, of <i>Proceedings of Machine Learning Research</i>, pages 2341–2349, 13–15 Apr 2021. PMLR\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://proceedings.mlr.press/v130/nikolopoulos21a.html\"\n     onclick=\"log_download('nikolopoulos-rajansrinivasavaradhan-guo-fragouli-diggavi-grouptestingforconnectedcommunities-2021', 'https://proceedings.mlr.press/v130/nikolopoulos21a.html', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Group testing for connected communities  [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/nikolopoulos-rajansrinivasavaradhan-guo-fragouli-diggavi-grouptestingforconnectedcommunities-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>5 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('nikolopoulos-rajansrinivasavaradhan-guo-fragouli-diggavi-grouptestingforconnectedcommunities-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{pmlr-v130-nikolopoulos21a,\n  type={4},\n  tags={group_testing,pavlos},\n  title =  { Group testing for connected communities },\n  author =  {Nikolopoulos, Pavlos and Rajan Srinivasavaradhan, Sundara and Guo, Tao and Fragouli, Christina and Diggavi, Suhas},\n  booktitle =  {Proceedings of The 24th International Conference on Artificial Intelligence and Statistics},\n  pages =  {2341--2349},\n  year = {2021},\n  editor = {Banerjee, Arindam and Fukumizu, Kenji},\n  volume = {130},\n  series = {Proceedings of Machine Learning Research},\n  month =  {13--15 Apr},\n  publisher =    {PMLR},\n  pdf =    {http://proceedings.mlr.press/v130/nikolopoulos21a/nikolopoulos21a.pdf},\n  url =    {https://proceedings.mlr.press/v130/nikolopoulos21a.html}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"vestergaard-hanna-song-lucani-fragouli-oncodedbroadcastingforwirelessrecommendationsystems-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Rasmus Vestergaard;  Osama Hanna;  Linqi Song;  Daniel E Lucani;  and  Christina Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On Coded Broadcasting for Wireless Recommendation Systems.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>ICC 2021-IEEE International Conference on Communications</i>, pages 1–6,  2021. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/vestergaard-hanna-song-lucani-fragouli-oncodedbroadcastingforwirelessrecommendationsystems-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('vestergaard-hanna-song-lucani-fragouli-oncodedbroadcastingforwirelessrecommendationsystems-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{vestergaard2021coded,\n  type={4},\n  tags={osama},\n  title={On Coded Broadcasting for Wireless Recommendation Systems},\n  author={Vestergaard, Rasmus and Hanna, Osama and Song, Linqi and Lucani, Daniel E and Fragouli, Christina},\n  booktitle={ICC 2021-IEEE International Conference on Communications},\n  pages={1--6},\n  year={2021},\n  tags = {ML_CC},\n  organization={IEEE}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"nikolopoulos-srinivasavaradhan-guo-fragouli-diggavi-grouptestingforoverlappingcommunities-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Pavlos Nikolopoulos;  Sundara Rajan Srinivasavaradhan;  Tao Guo;  Christina Fragouli;  and  Suhas Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Group testing for overlapping communities.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Conference on Communications (ICC)</i>, July 2021. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/nikolopoulos-srinivasavaradhan-guo-fragouli-diggavi-grouptestingforoverlappingcommunities-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('nikolopoulos-srinivasavaradhan-guo-fragouli-diggavi-grouptestingforoverlappingcommunities-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{nikolopoulos2020ICC,\n  type={4},\n  tags = {group_testing,pavlos},\n  author = {Nikolopoulos, Pavlos and Srinivasavaradhan, Sundara Rajan and Guo, Tao and Fragouli, Christina and Diggavi, Suhas},\n  booktitle = {{IEEE} {International} {Conference on} {Communications} ({ICC})},\n  title = {Group testing for overlapping communities},\n  month = July,\n  year = {2021}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_inproceedings\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_inproceedings')\"\n      onkeypress=\"toggleGroup('group_inproceedings')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>inproceedings</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"vestergaard-hanna-song-lucani-fragouli-oncodedbroadcastingforwirelessrecommendationsystems-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Rasmus Vestergaard;  Osama Hanna;  Linqi Song;  Daniel E Lucani;  and  Christina Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On Coded Broadcasting for Wireless Recommendation Systems.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>ICC 2021-IEEE International Conference on Communications</i>, pages 1–6,  2021. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/vestergaard-hanna-song-lucani-fragouli-oncodedbroadcastingforwirelessrecommendationsystems-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('vestergaard-hanna-song-lucani-fragouli-oncodedbroadcastingforwirelessrecommendationsystems-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{vestergaard2021coded,\n  tags={osama},\n  title={On Coded Broadcasting for Wireless Recommendation Systems},\n  author={Vestergaard, Rasmus and Hanna, Osama and Song, Linqi and Lucani, Daniel E and Fragouli, Christina},\n  booktitle={ICC 2021-IEEE International Conference on Communications},\n  pages={1--6},\n  year={2021},\n  organization={IEEE}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2020\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2020')\"\n      onkeypress=\"toggleGroup('group_2020')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2020</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_1\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1')\"\n      onkeypress=\"toggleGroup('group_1')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"nikolopoulos-guo-srinivasavaradhan-fragouli-diggavi-communityawaregrouptesting-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Pavlos Nikolopoulos;  Tao Guo;  Sundara Rajan Srinivasavaradhan;  Christina Fragouli;  and  Suhas Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Community aware group testing.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>arXiv preprint arXiv:2007.08111</i>. July 2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/nikolopoulos-guo-srinivasavaradhan-fragouli-diggavi-communityawaregrouptesting-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('nikolopoulos-guo-srinivasavaradhan-fragouli-diggavi-communityawaregrouptesting-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{nikolopoulos2020community,\n  type={1},\n  title={Community aware group testing},\n  author={Nikolopoulos, Pavlos and Guo, Tao and Srinivasavaradhan, Sundara Rajan and Fragouli, Christina and Diggavi, Suhas},\n  journal={arXiv preprint arXiv:2007.08111},\n  tags = {group_testing},\n  month = July,\n  year={2020}\n}\n\n% @article{nikolopoulos2020group,\n%   type={1},\n%   title={Group testing for overlapping communities},\n%   author={Nikolopoulos, Pavlos and Srinivasavaradhan, Sundara Rajan and Guo, Tao and Fragouli, Christina and Diggavi, Suhas},\n%   journal={arXiv preprint arXiv:2012.02804},\n%   tags = {group_testing},\n%   month = dec,\n%   year={2020}\n% }\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (10)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"song-fragouli-zhao-apliableindexcodingapproachtodatashuffling-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Linqi Song;  Christina Fragouli;  and  Tianchu Zhao.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Pliable Index Coding Approach to Data Shuffling.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 66(3): 1333-1353.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TIT.2019.2954338\"\n     onclick=\"log_download('song-fragouli-zhao-apliableindexcodingapproachtodatashuffling-2020', 'http://doi.org/10.1109/TIT.2019.2954338', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/song-fragouli-zhao-apliableindexcodingapproachtodatashuffling-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('song-fragouli-zhao-apliableindexcodingapproachtodatashuffling-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@ARTICLE{8906011,\n  type={2},\n  tags = {network_coding},\n  author={Song, Linqi and Fragouli, Christina and Zhao, Tianchu},\n  journal={IEEE Transactions on Information Theory}, \n  title={A Pliable Index Coding Approach to Data Shuffling}, \n  year={2020},\n  volume={66},\n  number={3},\n  pages={1333-1353},\n  doi={10.1109/TIT.2019.2954338}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"karmoose-song-cardone-fragouli-privacyinindexcodingklimitedaccessschemes-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Mohammed Karmoose;  Linqi Song;  Martina Cardone;  and  Christina Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Privacy in Index Coding: $k$ -Limited-Access Schemes.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 66(5): 2625-2641.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TIT.2019.2957577\"\n     onclick=\"log_download('karmoose-song-cardone-fragouli-privacyinindexcodingklimitedaccessschemes-2020', 'http://doi.org/10.1109/TIT.2019.2957577', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/karmoose-song-cardone-fragouli-privacyinindexcodingklimitedaccessschemes-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('karmoose-song-cardone-fragouli-privacyinindexcodingklimitedaccessschemes-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@ARTICLE{8922781,\n  type={2},\n  tags={na},\n  author={Karmoose, Mohammed and Song, Linqi and Cardone, Martina and Fragouli, Christina},\n  journal={IEEE Transactions on Information Theory}, \n  title={Privacy in Index Coding:  $k$ -Limited-Access Schemes}, \n  year={2020},\n  volume={66},\n  number={5},\n  pages={2625-2641},\n  doi={10.1109/TIT.2019.2957577}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ezzeldin-cardone-fragouli-tuninetti-theapproximatecapacityofhalfduplexlinenetworks-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Yahya H. Ezzeldin;  Martina Cardone;  Christina Fragouli;  and  Daniela Tuninetti.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  The Approximate Capacity of Half-Duplex Line Networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 66(7): 4449-4467.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TIT.2020.2998184\"\n     onclick=\"log_download('ezzeldin-cardone-fragouli-tuninetti-theapproximatecapacityofhalfduplexlinenetworks-2020', 'http://doi.org/10.1109/TIT.2020.2998184', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ezzeldin-cardone-fragouli-tuninetti-theapproximatecapacityofhalfduplexlinenetworks-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ezzeldin-cardone-fragouli-tuninetti-theapproximatecapacityofhalfduplexlinenetworks-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@ARTICLE{9103123,\n  type={2},\n  tags={na},\n  author={Ezzeldin, Yahya H. and Cardone, Martina and Fragouli, Christina and Tuninetti, Daniela},\n  journal={IEEE Transactions on Information Theory}, \n  title={The Approximate Capacity of Half-Duplex Line Networks}, \n  year={2020},\n  volume={66},\n  number={7},\n  pages={4449-4467},\n  doi={10.1109/TIT.2020.2998184}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ezzeldin-sengupta-fragouli-wirelessnetworksimplificationtheperformanceofrouting-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Yahya H. Ezzeldin;  Ayan Sengupta;  and  Christina Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Wireless Network Simplification: The Performance of Routing.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 66(9): 5703-5711.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TIT.2020.3010990\"\n     onclick=\"log_download('ezzeldin-sengupta-fragouli-wirelessnetworksimplificationtheperformanceofrouting-2020', 'http://doi.org/10.1109/TIT.2020.3010990', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ezzeldin-sengupta-fragouli-wirelessnetworksimplificationtheperformanceofrouting-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ezzeldin-sengupta-fragouli-wirelessnetworksimplificationtheperformanceofrouting-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@ARTICLE{9145607,\n  type={2},\n  tags={na},\n  author={Ezzeldin, Yahya H. and Sengupta, Ayan and Fragouli, Christina},\n  journal={IEEE Transactions on Information Theory}, \n  title={Wireless Network Simplification: The Performance of Routing}, \n  year={2020},\n  volume={66},\n  number={9},\n  pages={5703-5711},\n  doi={10.1109/TIT.2020.3010990}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"girgis-data-chaudhuri-fragouli-diggavi-successiverefinementofprivacy-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Antonious M. Girgis;  Deepesh Data;  Kamalika Chaudhuri;  Christina Fragouli;  and  Suhas N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Successive Refinement of Privacy.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Journal on Selected Areas in Information Theory</i>, 1(3): 745-759.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/JSAIT.2020.3040403\"\n     onclick=\"log_download('girgis-data-chaudhuri-fragouli-diggavi-successiverefinementofprivacy-2020', 'http://doi.org/10.1109/JSAIT.2020.3040403', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/girgis-data-chaudhuri-fragouli-diggavi-successiverefinementofprivacy-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('girgis-data-chaudhuri-fragouli-diggavi-successiverefinementofprivacy-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@ARTICLE{9270285,\n  type={2},\n  tags={na},\n  author={Girgis, Antonious M. and Data, Deepesh and Chaudhuri, Kamalika and Fragouli, Christina and Diggavi, Suhas N.},\n  journal={IEEE Journal on Selected Areas in Information Theory}, \n  title={Successive Refinement of Privacy}, \n  year={2020},\n  volume={1},\n  number={3},\n  pages={745-759},\n  doi={10.1109/JSAIT.2020.3040403}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"agarwal-cardone-fragouli-onsecurenetworkcodingformultipleunicasttraffic-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   G. K. Agarwal;  M. Cardone;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On secure network coding for multiple unicast traffic.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/agarwal-cardone-fragouli-onsecurenetworkcodingformultipleunicasttraffic-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('agarwal-cardone-fragouli-onsecurenetworkcodingformultipleunicasttraffic-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{agarwal_secure_2020,\n type={2},\n author = {Agarwal, G. K. and Cardone, M. and Fragouli, C.},\n journal = {IEEE Transactions on Information Theory},\n tags = {security},\n title = {On secure network coding for multiple unicast traffic},\n year = {2020}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hanna-ezzeldin-sadjadpour-fragouli-diggavi-ondistributedquantizationforclassification-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   O. A. Hanna;  Y. H. Ezzeldin;  T. Sadjadpour;  C. Fragouli;  and  S. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On Distributed Quantization for Classification.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Journal on Selected Areas in Information Theory</i>.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hanna-ezzeldin-sadjadpour-fragouli-diggavi-ondistributedquantizationforclassification-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hanna-ezzeldin-sadjadpour-fragouli-diggavi-ondistributedquantizationforclassification-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{hanna_distributed_2020,\n type={2},\n tags={osama},\n author = {Hanna, O. A. and Ezzeldin, Y. H. and Sadjadpour, T. and Fragouli, C. and Diggavi, S.},\n journal = {IEEE Journal on Selected Areas in Information Theory},\n tags = {ML_CC},\n title = {On Distributed Quantization for Classification},\n year = {2020}\n}\n\n\n% @article{srinivasavaradhan2020algorithms,\n%   type={1},\n%   title={Algorithms for reconstruction over single and multiple deletion channels},\n%   author={Srinivasavaradhan, SR and Du, Michelle and Diggavi, S. and Fragouli, C.},\n%   journal={arXiv preprint arXiv:2005.14388},\n%   tags = {bio,channel_coding},\n%   year={2020}\n% }\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"agarwal-karmoose-diggavi-fragouli-tabuada-distortionbasedlightweightsecurityforcyberphysicalsystems-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   G. K. Agarwal;  M. Karmoose;  S. Diggavi;  C. Fragouli;  and  P. Tabuada.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Distortion based Light-weight Security for Cyber-Physical Systems.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Automatic Control</i>.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/agarwal-karmoose-diggavi-fragouli-tabuada-distortionbasedlightweightsecurityforcyberphysicalsystems-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('agarwal-karmoose-diggavi-fragouli-tabuada-distortionbasedlightweightsecurityforcyberphysicalsystems-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{agarwal_distortion_2020,\n type={2},\n author = {Agarwal, G. K. and Karmoose, M. and Diggavi, S. and Fragouli, C. and Tabuada, P.},\n journal = {IEEE Transactions on Automatic Control},\n tags = {security},\n title = {Distortion based {Light}-weight {Security} for {Cyber}-{Physical} {Systems}},\n year = {2020}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ezzeldin-cardone-fragouli-tuninetti-theapproximatecapacityofhalfduplexlinenetworks-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Y. H. Ezzeldin;  M. Cardone;  C. Fragouli;  and  D. Tuninetti.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  The Approximate Capacity of Half-Duplex Line Networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ezzeldin-cardone-fragouli-tuninetti-theapproximatecapacityofhalfduplexlinenetworks-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ezzeldin-cardone-fragouli-tuninetti-theapproximatecapacityofhalfduplexlinenetworks-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{ezzeldin_approximate_2020,\n type={2},\n author = {Ezzeldin, Y. H. and Cardone, M. and Fragouli, C. and Tuninetti, D.},\n journal = {IEEE Transactions on Information Theory},\n tags = {wireless},\n title = {The {Approximate} {Capacity} of {Half}-{Duplex} {Line} {Networks}},\n year = {2020}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ezzeldin-sengupta-fragouli-wirelessnetworksimplificationtheperformanceofrouting-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Y. H. Ezzeldin;  A. Sengupta;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Wireless Network Simplification: The Performance of Routing.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ezzeldin-sengupta-fragouli-wirelessnetworksimplificationtheperformanceofrouting-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ezzeldin-sengupta-fragouli-wirelessnetworksimplificationtheperformanceofrouting-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{ezzeldin_wireless_2020,\n type={2},\n author = {Ezzeldin, Y. H. and Sengupta, A. and Fragouli, C.},\n journal = {IEEE Transactions on Information Theory},\n tags = {wireless},\n title = {Wireless {Network} {Simplification}: {The} {Performance} of {Routing}},\n year = {2020}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (6)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"srinivasavaradhan-diggavi-fragouli-equivalenceofmldecodingtoacontinuousoptimizationproblem-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Sundara Rajan Srinivasavaradhan;  Suhas Diggavi;  and  Christina Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Equivalence of ML decoding to a continuous optimization problem.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>2020 IEEE International Symposium on Information Theory (ISIT)</i>, pages 343-348,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ISIT44484.2020.9174130\"\n     onclick=\"log_download('srinivasavaradhan-diggavi-fragouli-equivalenceofmldecodingtoacontinuousoptimizationproblem-2020', 'http://doi.org/10.1109/ISIT44484.2020.9174130', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/srinivasavaradhan-diggavi-fragouli-equivalenceofmldecodingtoacontinuousoptimizationproblem-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('srinivasavaradhan-diggavi-fragouli-equivalenceofmldecodingtoacontinuousoptimizationproblem-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@INPROCEEDINGS{9174130,\n  type={4},\n  tags = {bio},\n  author={Srinivasavaradhan, Sundara Rajan and Diggavi, Suhas and Fragouli, Christina},\n  booktitle={2020 IEEE International Symposium on Information Theory (ISIT)}, \n  title={Equivalence of ML decoding to a continuous optimization problem}, \n  year={2020},\n  volume={},\n  number={},\n  pages={343-348},\n  doi={10.1109/ISIT44484.2020.9174130}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ezzeldin-cardone-fragouli-caire-gaussian121networkswithimperfectbeamforming-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Yahya H. Ezzeldin;  Martina Cardone;  Christina Fragouli;  and  Giuseppe Caire.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Gaussian 1-2-1 Networks with Imperfect Beamforming.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>2020 IEEE International Symposium on Information Theory (ISIT)</i>, pages 1599-1604,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ISIT44484.2020.9174233\"\n     onclick=\"log_download('ezzeldin-cardone-fragouli-caire-gaussian121networkswithimperfectbeamforming-2020', 'http://doi.org/10.1109/ISIT44484.2020.9174233', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ezzeldin-cardone-fragouli-caire-gaussian121networkswithimperfectbeamforming-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ezzeldin-cardone-fragouli-caire-gaussian121networkswithimperfectbeamforming-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@INPROCEEDINGS{9174233,\n  type={4},\n  tags = {wireless},\n  author={Ezzeldin, Yahya H. and Cardone, Martina and Fragouli, Christina and Caire, Giuseppe},\n  booktitle={2020 IEEE International Symposium on Information Theory (ISIT)}, \n  title={Gaussian 1-2-1 Networks with Imperfect Beamforming}, \n  year={2020},\n  volume={},\n  number={},\n  pages={1599-1604},\n  doi={10.1109/ISIT44484.2020.9174233}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"li-song-fragouli-federatedrecommendationsystemviadifferentialprivacy-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Tan Li;  Linqi Song;  and  Christina Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Federated Recommendation System via Differential Privacy.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>2020 IEEE International Symposium on Information Theory (ISIT)</i>, pages 2592-2597,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ISIT44484.2020.9174297\"\n     onclick=\"log_download('li-song-fragouli-federatedrecommendationsystemviadifferentialprivacy-2020', 'http://doi.org/10.1109/ISIT44484.2020.9174297', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/li-song-fragouli-federatedrecommendationsystemviadifferentialprivacy-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('li-song-fragouli-federatedrecommendationsystemviadifferentialprivacy-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@INPROCEEDINGS{9174297,\n  type={4},\n  tags = {na},\n  author={Li, Tan and Song, Linqi and Fragouli, Christina},\n  booktitle={2020 IEEE International Symposium on Information Theory (ISIT)}, \n  title={Federated Recommendation System via Differential Privacy}, \n  year={2020},\n  volume={},\n  number={},\n  pages={2592-2597},\n  doi={10.1109/ISIT44484.2020.9174297}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"rebanal-ezzeldin--fragouli-tabuada-acodingapproachtolocalizationusinglandmarks-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   J. C. Rebanal;  Y. H. Ezzeldin;  ;  C. Fragouli;  and  P. Tabuada.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A coding approach to localization using landmarks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Globecom</i>,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/rebanal-ezzeldin--fragouli-tabuada-acodingapproachtolocalizationusinglandmarks-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('rebanal-ezzeldin--fragouli-tabuada-acodingapproachtolocalizationusinglandmarks-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{rebanal_distorting_2020,\n type={4},\n author = {Rebanal, J. C. and Ezzeldin, Y. H. and and Fragouli, C. and Tabuada, P.},\n booktitle = {{IEEE} Globecom},\n tags = {channel_coding},\n title = {A coding approach to localization using landmarks},\n year = {2020}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"mao-diggavi-fragouli-tabuada-securestatereconstructionovernetworkssubjecttoattacks-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Y Mao;  S. Diggavi;  C. Fragouli;  and  P. Tabuada.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Secure State-Reconstruction Over Networks Subject to Attacks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Control Systems Letters</i>.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mao-diggavi-fragouli-tabuada-securestatereconstructionovernetworkssubjecttoattacks-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mao-diggavi-fragouli-tabuada-securestatereconstructionovernetworkssubjecttoattacks-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{mao_secure_2020,\n type={4},\n author = {Mao, Y and Diggavi, S. and Fragouli, C. and Tabuada, P.},\n journal = {IEEE Control Systems Letters},\n tags = {security},\n title = {Secure {State}-{Reconstruction} {Over} {Networks} {Subject} to {Attacks}},\n year = {2020}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"srinivasavaradhan-fragouli-diggavi-equivalenceofmldecodingtoacontinuousoptimizationproblem-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   SR Srinivasavaradhan;  C. Fragouli;  and  S. N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Equivalence of ML decoding to a continuous optimization problem.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Symposium on Information Theory</i>.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/srinivasavaradhan-fragouli-diggavi-equivalenceofmldecodingtoacontinuousoptimizationproblem-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('srinivasavaradhan-fragouli-diggavi-equivalenceofmldecodingtoacontinuousoptimizationproblem-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{srinivasavaradhan_equivalence_2020,\n type={4},\n author = {Srinivasavaradhan, SR and Fragouli, C. and Diggavi, S. N.},\n journal = {IEEE Symposium on Information Theory},\n tags = {channel_coding, bio},\n title = {Equivalence of {ML} decoding to a continuous optimization problem},\n year = {2020}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2019\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2019')\"\n      onkeypress=\"toggleGroup('group_2019')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2019</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (6)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"karmoose-fragouli-diggavi-misoczki-yang-zhang-usingmmwavesforsecretkeyestablishment-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Mohammed Karmoose;  Christina Fragouli;  Suhas Diggavi;  Rafael Misoczki;  Lily L. Yang;  and  Zhenliang Zhang.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Using mm-Waves for Secret Key Establishment.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Communications Letters</i>, 23(6): 1077-1080.  2019.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/LCOMM.2019.2909918\"\n     onclick=\"log_download('karmoose-fragouli-diggavi-misoczki-yang-zhang-usingmmwavesforsecretkeyestablishment-2019', 'http://doi.org/10.1109/LCOMM.2019.2909918', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/karmoose-fragouli-diggavi-misoczki-yang-zhang-usingmmwavesforsecretkeyestablishment-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('karmoose-fragouli-diggavi-misoczki-yang-zhang-usingmmwavesforsecretkeyestablishment-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@ARTICLE{8684919,\n  type={2},\n  tags={na},\n  author={Karmoose, Mohammed and Fragouli, Christina and Diggavi, Suhas and Misoczki, Rafael and Yang, Lily L. and Zhang, Zhenliang},\n  journal={IEEE Communications Letters}, \n  title={Using mm-Waves for Secret Key Establishment}, \n  year={2019},\n  volume={23},\n  number={6},\n  pages={1077-1080},\n  doi={10.1109/LCOMM.2019.2909918}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ezzeldin-cardone-fragouli-tuninetti-networksimplificationinhalfduplexbuildingonsubmodularity-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Yahya H. Ezzeldin;  Martina Cardone;  Christina Fragouli;  and  Daniela Tuninetti.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Network Simplification in Half-Duplex: Building on Submodularity.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 65(10): 6801-6818.  2019.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TIT.2019.2923994\"\n     onclick=\"log_download('ezzeldin-cardone-fragouli-tuninetti-networksimplificationinhalfduplexbuildingonsubmodularity-2019', 'http://doi.org/10.1109/TIT.2019.2923994', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ezzeldin-cardone-fragouli-tuninetti-networksimplificationinhalfduplexbuildingonsubmodularity-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ezzeldin-cardone-fragouli-tuninetti-networksimplificationinhalfduplexbuildingonsubmodularity-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@ARTICLE{8742589,\n  type={2},\n  tags={na},\n  author={Ezzeldin, Yahya H. and Cardone, Martina and Fragouli, Christina and Tuninetti, Daniela},\n  journal={IEEE Transactions on Information Theory}, \n  title={Network Simplification in Half-Duplex: Building on Submodularity}, \n  year={2019},\n  volume={65},\n  number={10},\n  pages={6801-6818},\n  doi={10.1109/TIT.2019.2923994}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"song-fragouli-shah-interactionsbetweenlearningandbroadcastinginwirelessrecommendationsystems-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Linqi Song;  Christina Fragouli;  and  Devavrat Shah.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Interactions Between Learning and Broadcasting in Wireless Recommendation Systems.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>2019 IEEE International Symposium on Information Theory (ISIT)</i>, pages 2549-2553,  2019. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ISIT.2019.8849556\"\n     onclick=\"log_download('song-fragouli-shah-interactionsbetweenlearningandbroadcastinginwirelessrecommendationsystems-2019', 'http://doi.org/10.1109/ISIT.2019.8849556', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/song-fragouli-shah-interactionsbetweenlearningandbroadcastinginwirelessrecommendationsystems-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('song-fragouli-shah-interactionsbetweenlearningandbroadcastinginwirelessrecommendationsystems-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@INPROCEEDINGS{8849556,\n  type={2},\n  tags={na},\n  author={Song, Linqi and Fragouli, Christina and Shah, Devavrat},\n  booktitle={2019 IEEE International Symposium on Information Theory (ISIT)}, \n  title={Interactions Between Learning and Broadcasting in Wireless Recommendation Systems}, \n  year={2019},\n  volume={},\n  number={},\n  pages={2549-2553},\n  doi={10.1109/ISIT.2019.8849556}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"agarwal-cardone-fragouli-onsecurecapacityofmultipleunicasttrafficoverseparablenetworks-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Gaurav Kumar Agarwal;  Martina Cardone;  and  Christina Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On Secure Capacity of Multiple Unicast Traffic over Separable Networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>2019 IEEE Information Theory Workshop (ITW)</i>, pages 1-5,  2019. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ITW44776.2019.8988985\"\n     onclick=\"log_download('agarwal-cardone-fragouli-onsecurecapacityofmultipleunicasttrafficoverseparablenetworks-2019', 'http://doi.org/10.1109/ITW44776.2019.8988985', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/agarwal-cardone-fragouli-onsecurecapacityofmultipleunicasttrafficoverseparablenetworks-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('agarwal-cardone-fragouli-onsecurecapacityofmultipleunicasttrafficoverseparablenetworks-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@INPROCEEDINGS{8988985,\n  type={2},\n  tags={na},\n  author={Agarwal, Gaurav Kumar and Cardone, Martina and Fragouli, Christina},\n  booktitle={2019 IEEE Information Theory Workshop (ITW)}, \n  title={On Secure Capacity of Multiple Unicast Traffic over Separable Networks}, \n  year={2019},\n  volume={},\n  number={},\n  pages={1-5},\n  doi={10.1109/ITW44776.2019.8988985}}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ezzeldin-cardone-fragouli-tuninetti-networksimplificationbuildingonsubmodularity-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Y. H. Ezzeldin;  M. Cardone;  C. Fragouli;  and  D. Tuninetti.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Network Simplification: Building on Submodularity.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>.  2019.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ezzeldin-cardone-fragouli-tuninetti-networksimplificationbuildingonsubmodularity-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ezzeldin-cardone-fragouli-tuninetti-networksimplificationbuildingonsubmodularity-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{ezzeldin_network_2019,\n type={2},\n author = {Ezzeldin, Y. H. and Cardone, M. and Fragouli, C. and Tuninetti, D.},\n journal = {IEEE Transactions on Information Theory},\n tags = {wireless},\n title = {Network {Simplification}: {Building} on {Submodularity}},\n year = {2019}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"karmoose-song-cardone-fragouli-privacyinindexcodingklimitedaccessschemes-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   M. Karmoose;  L. Song;  M. Cardone;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Privacy in Index Coding: k-Limited-Access Schemes.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>.  2019.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/karmoose-song-cardone-fragouli-privacyinindexcodingklimitedaccessschemes-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('karmoose-song-cardone-fragouli-privacyinindexcodingklimitedaccessschemes-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{karmoose_privacy_2019,\n type={2},\n author = {Karmoose, M. and Song, L. and Cardone, M. and Fragouli, C.},\n journal = {IEEE Transactions on Information Theory},\n tags = {network_coding},\n title = {Privacy in {Index} {Coding}: k-{Limited}-{Access} {Schemes}},\n year = {2019}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (7)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"song-fragouli-shah-interactionsbetweenlearningandbroadcastinginwirelessrecommendationsystems-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Song;  C. Fragouli;  and  D. Shah.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Interactions Between Learning and Broadcasting in Wireless Recommendation Systems.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>,  2019. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/song-fragouli-shah-interactionsbetweenlearningandbroadcastinginwirelessrecommendationsystems-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('song-fragouli-shah-interactionsbetweenlearningandbroadcastinginwirelessrecommendationsystems-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{song_interactions_2019,\n type={4},\n author = {Song, L. and Fragouli, C. and Shah, D.},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n tags = {ML_CC},\n title = {Interactions {Between} {Learning} and {Broadcasting} in {Wireless} {Recommendation} {Systems}},\n year = {2019}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ezzeldin-fragouli-diggavi-quantizingsignalsforlinearclassification-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Y. H. Ezzeldin;  C. Fragouli;  and  S. N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Quantizing Signals for Linear Classification.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE International Symposium of Information Theory (ISIT)</i>.  2019.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ezzeldin-fragouli-diggavi-quantizingsignalsforlinearclassification-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ezzeldin-fragouli-diggavi-quantizingsignalsforlinearclassification-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{ezzeldin_quantizing_2019,\n type={4},\n author = {Ezzeldin, Y. H. and Fragouli, C. and Diggavi, S. N.},\n journal = {IEEE International Symposium of Information Theory (ISIT)},\n tags = {ML_CC},\n title = {Quantizing Signals for Linear Classification},\n year = {2019}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"agarwal-cardone-fragouli-onsecurecapacityofmultipleunicasttrafficoverseparablenetworks-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   G. K. Agarwal;  M. Cardone;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On Secure Capacity of Multiple Unicast Traffic over Separable Networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Workshop on Information Theory (ITW)</i>,  2019. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/agarwal-cardone-fragouli-onsecurecapacityofmultipleunicasttrafficoverseparablenetworks-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('agarwal-cardone-fragouli-onsecurecapacityofmultipleunicasttrafficoverseparablenetworks-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{agarwal_secure_2019,\n type={4},\n author = {Agarwal, G. K. and Cardone, M. and Fragouli, C.},\n booktitle = {{IEEE} {International} {Workshop} on {Information} {Theory} ({ITW})},\n tags = {security},\n title = {On {Secure} {Capacity} of {Multiple} {Unicast} {Traffic} over {Separable} {Networks}},\n year = {2019}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ezzeldin-cardone-fragouli-caire-onthemulticastcapacityoffullduplex121networks-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Y. H. Ezzeldin;  M. Cardone;  C. Fragouli;  and  Giuseppe Caire.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On the Multicast Capacity of Full-Duplex 1-2-1 Networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE International Symposium of Information Theory (ISIT)</i>.  2019.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ezzeldin-cardone-fragouli-caire-onthemulticastcapacityoffullduplex121networks-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ezzeldin-cardone-fragouli-caire-onthemulticastcapacityoffullduplex121networks-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{ezzeldin_multicast_2019,\n type={4},\n author = {Ezzeldin, Y. H. and Cardone, M. and Fragouli, C. and Caire, Giuseppe},\n journal = {IEEE International Symposium of Information Theory (ISIT)},\n tags = {wireless},\n title = {On the {Multicast} {Capacity} of {Full}-{Duplex} 1-2-1 {Networks}},\n year = {2019}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ezzeldin-cardone-fragouli-caire-polynomialtimecapacitycalculationandschedulingforhalfduplex121network-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Y. H. Ezzeldin;  M. Cardone;  C. Fragouli;  and  Giuseppe Caire.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Polynomial-time Capacity Calculation and Scheduling for Half-Duplex 1-2-1 Network.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE International Symposium of Information Theory (ISIT)</i>.  2019.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ezzeldin-cardone-fragouli-caire-polynomialtimecapacitycalculationandschedulingforhalfduplex121network-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ezzeldin-cardone-fragouli-caire-polynomialtimecapacitycalculationandschedulingforhalfduplex121network-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{ezzeldin_polynomial-time_2019,\n type={4},\n author = {Ezzeldin, Y. H. and Cardone, M. and Fragouli, C. and Caire, Giuseppe},\n journal = {IEEE International Symposium of Information Theory (ISIT)},\n tags = {wireless},\n title = {Polynomial-time {Capacity} {Calculation} and {Scheduling} for {Half}-{Duplex} 1-2-1 {Network}},\n year = {2019}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"karmoose-fragouli-diggavi-misoczki-yang-zhang-usingmmwavesforsecretkeyestablishmen-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   M. Karmoose;  C. Fragouli;  S. N. Diggavi;  Rafael Misoczki;  Lily L. Yang;  and  Zhenliang Zhang.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Using mm-Waves for Secret Key Establishmen.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Communications Letters</i>,  2019. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/karmoose-fragouli-diggavi-misoczki-yang-zhang-usingmmwavesforsecretkeyestablishmen-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('karmoose-fragouli-diggavi-misoczki-yang-zhang-usingmmwavesforsecretkeyestablishmen-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{karmoose_using_2019,\n type={4},\n author = {Karmoose, M. and Fragouli, C. and Diggavi, S. N. and Misoczki, Rafael and Yang, Lily L. and Zhang, Zhenliang},\n booktitle = {{IEEE} {Communications} {Letters}},\n tags = {security},\n title = {Using mm-{Waves} for {Secret} {Key} {Establishmen}},\n year = {2019}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"srinivasavaradhan-du-diggavi-fragouli-symbolwisemapformultipledeletionchannels-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   SR Srinivasavaradhan;  Michelle Du;  Suhas Diggavi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Symbolwise MAP for Multiple Deletion Channels.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE International Symposium of Information Theory (ISIT)</i>.  2019.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/srinivasavaradhan-du-diggavi-fragouli-symbolwisemapformultipledeletionchannels-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('srinivasavaradhan-du-diggavi-fragouli-symbolwisemapformultipledeletionchannels-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{srinivasavaradhan_symbolwise_2019,\n type={4},\n author = {Srinivasavaradhan, SR and Du, Michelle and Diggavi, Suhas and Fragouli, C.},\n journal = {IEEE International Symposium of Information Theory (ISIT)},\n tags = {channel_coding, bio},\n title = {Symbolwise {MAP} for {Multiple} {Deletion} {Channels}},\n year = {2019}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2018\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2018')\"\n      onkeypress=\"toggleGroup('group_2018')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2018</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"karmoose-cardone-fragouli-simplifyingwirelesssocialcachingvianetworkcoding-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   M. Karmoose;  M. Cardone;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Simplifying Wireless Social Caching via Network Coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Transactions on Communications</i>,  2018. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/karmoose-cardone-fragouli-simplifyingwirelesssocialcachingvianetworkcoding-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('karmoose-cardone-fragouli-simplifyingwirelesssocialcachingvianetworkcoding-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{karmoose_simplifying_2018,\n type={2},\n author = {Karmoose, M. and Cardone, M. and Fragouli, C.},\n booktitle = {{IEEE} {Transactions} on {Communications}},\n tags = {network_coding},\n title = {Simplifying {Wireless} {Social} {Caching} via {Network} {Coding}},\n year = {2018}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"song-fragouli-makingrecommendationsbandwidthaware-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Song;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Making recommendations bandwidth aware.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Transactions on Information Theory</i>,  2018. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/song-fragouli-makingrecommendationsbandwidthaware-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('song-fragouli-makingrecommendationsbandwidthaware-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{song_making_2018,\n type={2},\n author = {Song, L. and Fragouli, C.},\n booktitle = {{IEEE} {Transactions} on {Information} {Theory}},\n tags = {network_coding},\n title = {Making recommendations bandwidth aware},\n year = {2018}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"song-fragouli-apolynomialtimealgorithmforpliableindexcoding-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Song;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A polynomial-time algorithm for pliable index coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Transactions on Information Theory</i>,  2018. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/song-fragouli-apolynomialtimealgorithmforpliableindexcoding-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('song-fragouli-apolynomialtimealgorithmforpliableindexcoding-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{song_polynomial-time_2018,\n type={2},\n author = {Song, L. and Fragouli, C.},\n booktitle = {{IEEE} {Transactions} on {Information} {Theory}},\n tags = {network_coding},\n title = {A polynomial-time algorithm for pliable index coding},\n year = {2018}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (6)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"agarwal-karmoose-diggavi-fragouli-tabuada-distortinganadversarysviewincyberphysicalsystems-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   G. K. Agarwal;  M. Karmoose;  S. Diggavi;  C. Fragouli;  and  P. Tabuada.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Distorting an Adversary's View in Cyber-Physical Systems.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Conference on Decision and Control (CDC)</i>,  2018. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/agarwal-karmoose-diggavi-fragouli-tabuada-distortinganadversarysviewincyberphysicalsystems-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('agarwal-karmoose-diggavi-fragouli-tabuada-distortinganadversarysviewincyberphysicalsystems-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{agarwal_distorting_2018,\n type={4},\n author = {Agarwal, G. K. and Karmoose, M. and Diggavi, S. and Fragouli, C. and Tabuada, P.},\n booktitle = {{IEEE} {Conference} on {Decision} and {Control} ({CDC})},\n tags = {security},\n title = {Distorting an {Adversary}&#x27;s {View} in {Cyber}-{Physical} {Systems}},\n year = {2018}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"srinivasavaradhan-song-fragouli-distributedcomputingtradeoffswithrandomconnectivity-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   SR Srinivasavaradhan;  L. Song;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Distributed Computing Trade-offs with Random Connectivity.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium of Information Theory (ISIT)</i>,  2018. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/srinivasavaradhan-song-fragouli-distributedcomputingtradeoffswithrandomconnectivity-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('srinivasavaradhan-song-fragouli-distributedcomputingtradeoffswithrandomconnectivity-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{srinivasavaradhan_distributed_2018,\n type={4},\n author = {Srinivasavaradhan, SR and Song, L. and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} of {Information} {Theory} ({ISIT})},\n tags = {ML_CC},\n title = {Distributed Computing Trade-offs with Random Connectivity},\n year = {2018}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"srinivasavaradhan-du-diggavi-fragouli-onmaximumlikelihoodreconstructionovermultipledeletionchannels-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   SR Srinivasavaradhan;  Michelle Du;  S. Diggavi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On Maximum Likelihood Reconstruction over Multiple Deletion Channels.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium of Information Theory (ISIT)</i>,  2018. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/srinivasavaradhan-du-diggavi-fragouli-onmaximumlikelihoodreconstructionovermultipledeletionchannels-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('srinivasavaradhan-du-diggavi-fragouli-onmaximumlikelihoodreconstructionovermultipledeletionchannels-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{srinivasavaradhan_maximum_2018,\n type={4},\n author = {Srinivasavaradhan, SR and Du, Michelle and Diggavi, S. and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} of {Information} {Theory} ({ISIT})},\n tags = {bio},\n title = {On Maximum Likelihood Reconstruction over Multiple Deletion Channels},\n year = {2018}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"agarwal-ezzeldin-cardone-fragouli-securecommunicationover121networks-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   G. K. Agarwal;  Y. H. Ezzeldin;  M. Cardone;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Secure Communication over 1-2-1 Networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium of Information Theory (ISIT)</i>,  2018. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/agarwal-ezzeldin-cardone-fragouli-securecommunicationover121networks-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('agarwal-ezzeldin-cardone-fragouli-securecommunicationover121networks-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{agarwal_secure_2018,\n type={4},\n author = {Agarwal, G. K. and Ezzeldin, Y. H. and Cardone, M. and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} of {Information} {Theory} ({ISIT})},\n tags = {security},\n title = {Secure {Communication} over 1-2-1 {Networks}},\n year = {2018}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ezzeldin-cardone-fragouli-caire-gaussian121networkscapacityresultsformmwavecommunications-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Y. H. Ezzeldin;  M. Cardone;  C. Fragouli;  and  Giuseppe Caire.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Gaussian 1-2-1 Networks: Capacity Results for mmWave Communications.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>,  2018. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ezzeldin-cardone-fragouli-caire-gaussian121networkscapacityresultsformmwavecommunications-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ezzeldin-cardone-fragouli-caire-gaussian121networkscapacityresultsformmwavecommunications-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{ezzeldin_gaussian_2018,\n type={4},\n author = {Ezzeldin, Y. H. and Cardone, M. and Fragouli, C. and Caire, Giuseppe},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n tags = {wireless},\n title = {Gaussian 1-2-1 {Networks}: {Capacity} {Results} for {mmWave} {Communications}},\n year = {2018}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"karmoose-song-cardone-fragouli-privacyinindexcodingimprovedboundsandcodingschemes-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   M. Karmoose;  L. Song;  M. Cardone;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Privacy in Index Coding: Improved Bounds and Coding Schemes.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>,  2018. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/karmoose-song-cardone-fragouli-privacyinindexcodingimprovedboundsandcodingschemes-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('karmoose-song-cardone-fragouli-privacyinindexcodingimprovedboundsandcodingschemes-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{karmoose_privacy_2018,\n type={4},\n author = {Karmoose, M. and Song, L. and Cardone, M. and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n tags = {network_coding},\n title = {Privacy in {Index} {Coding}: {Improved} {Bounds} and {Coding} {Schemes}},\n year = {2018}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_article\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_article')\"\n      onkeypress=\"toggleGroup('group_article')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>article</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"ellersgaardkalr-hanna-popovski-randomaccessschemesinwirelesssystemswithcorrelateduseractivity-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Anders Ellersgaard Kalør;  Osama A Hanna;  and  Petar Popovski.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Random Access Schemes in Wireless Systems With Correlated User Activity.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>arXiv e-prints</i>,arXiv–1803.  2018.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ellersgaardkalr-hanna-popovski-randomaccessschemesinwirelesssystemswithcorrelateduseractivity-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ellersgaardkalr-hanna-popovski-randomaccessschemesinwirelesssystemswithcorrelateduseractivity-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{ellersgaard2018random,\n  tags={osama},\n  title={Random Access Schemes in Wireless Systems With Correlated User Activity},\n  author={Ellersgaard Kal{\\o}r, Anders and Hanna, Osama A and Popovski, Petar},\n  journal={arXiv e-prints},\n  pages={arXiv--1803},\n  year={2018}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_inproceedings\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_inproceedings')\"\n      onkeypress=\"toggleGroup('group_inproceedings')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>inproceedings</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"kalor-hanna-popovski-randomaccessschemesinwirelesssystemswithcorrelateduseractivity-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Anders E Kalor;  Osama A Hanna;  and  Petar Popovski.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Random access schemes in wireless systems with correlated user activity.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)</i>, pages 1–5,  2018. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/kalor-hanna-popovski-randomaccessschemesinwirelesssystemswithcorrelateduseractivity-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('kalor-hanna-popovski-randomaccessschemesinwirelesssystemswithcorrelateduseractivity-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{kalor2018random,\n  tags={osama},\n  title={Random access schemes in wireless systems with correlated user activity},\n  author={Kalor, Anders E and Hanna, Osama A and Popovski, Petar},\n  booktitle={2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)},\n  pages={1--5},\n  year={2018},\n  organization={IEEE}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2017\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2017')\"\n      onkeypress=\"toggleGroup('group_2017')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2017</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (10)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"ezzeldin-karmoose-fragouli-communicationvsdistributedcomputationanalternativetradeoffcurve-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Y. H. Ezzeldin;  M. Karmoose;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Communication vs Distributed Computation: an alternative trade-off curve.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Information Theory Workshop (ITW)</i>,  2017. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ezzeldin-karmoose-fragouli-communicationvsdistributedcomputationanalternativetradeoffcurve-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ezzeldin-karmoose-fragouli-communicationvsdistributedcomputationanalternativetradeoffcurve-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{ezzeldin_communication_2017,\n type={4},\n author = {Ezzeldin, Y. H. and Karmoose, M. and Fragouli, C.},\n booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},\n tags = {ML_CC},\n title = {Communication vs Distributed Computation: an alternative trade-off curve},\n year = {2017}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"agarwal-cardone-fragouli-securenetworkcodingformultipleunicastonthecaseofsinglesource-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   G. K. Agarwal;  M. Cardone;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Secure Network Coding for Multiple Unicast: On the Case of Single Source.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>International Conference on Information Theoretic Security (ICITS)</i>,  2017. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/agarwal-cardone-fragouli-securenetworkcodingformultipleunicastonthecaseofsinglesource-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('agarwal-cardone-fragouli-securenetworkcodingformultipleunicastonthecaseofsinglesource-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{agarwal_secure_2017,\n type={4},\n author = {Agarwal, G. K. and Cardone, M. and Fragouli, C.},\n booktitle = {International {Conference} on {Information} {Theoretic} {Security} ({ICITS})},\n tags = {security},\n title = {Secure {Network} {Coding} for {Multiple} {Unicast}: {On} the {Case} of {Single} {Source}},\n year = {2017}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ezzeldin-cardone-fragouli-tuninetti-efficientlyfindingsimpleschedulesingaussianhalfduplexrelaylinenetworks-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Y. H. Ezzeldin;  M. Cardone;  C. Fragouli;  and  D. Tuninetti.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Efficiently Finding Simple Schedules in Gaussian Half-Duplex Relay Line Networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>,  2017. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ezzeldin-cardone-fragouli-tuninetti-efficientlyfindingsimpleschedulesingaussianhalfduplexrelaylinenetworks-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ezzeldin-cardone-fragouli-tuninetti-efficientlyfindingsimpleschedulesingaussianhalfduplexrelaylinenetworks-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{ezzeldin_efficiently_2017,\n type={4},\n author = {Ezzeldin, Y. H. and Cardone, M. and Fragouli, C. and Tuninetti, D.},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n tags = {wireless},\n title = {Efficiently {Finding} {Simple} {Schedules} in {Gaussian} {Half}-{Duplex} {Relay} {Line} {Networks}},\n year = {2017}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ezzeldin-cardone-fragouli-tuninetti-halfduplexroutingisnphard-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Y. H. Ezzeldin;  M. Cardone;  C. Fragouli;  and  D. Tuninetti.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Half-Duplex Routing is NP-hard.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Annual Allerton Conference on Communication, Control and Computing (Allerton)</i>,  2017. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ezzeldin-cardone-fragouli-tuninetti-halfduplexroutingisnphard-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ezzeldin-cardone-fragouli-tuninetti-halfduplexroutingisnphard-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{ezzeldin_half-duplex_2017,\n type={4},\n author = {Ezzeldin, Y. H. and Cardone, M. and Fragouli, C. and Tuninetti, D.},\n booktitle = {Annual {Allerton} {Conference} on {Communication}, {Control} and {Computing} ({Allerton})},\n tags = {wireless},\n title = {Half-{Duplex} {Routing} is {NP}-hard},\n year = {2017}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"karmoose-song-cardone-fragouli-preservingprivacywhilebroadcastingklimitedaccessschemes-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   M. Karmoose;  L. Song;  M. Cardone;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Preserving Privacy while Broadcasting: k-Limited-Access Schemes.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Information Theory Workshop (ITW)</i>,  2017. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/karmoose-song-cardone-fragouli-preservingprivacywhilebroadcastingklimitedaccessschemes-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('karmoose-song-cardone-fragouli-preservingprivacywhilebroadcastingklimitedaccessschemes-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{karmoose_preserving_2017,\n type={4},\n author = {Karmoose, M. and Song, L. and Cardone, M. and Fragouli, C.},\n booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},\n tags = {network_coding},\n title = {Preserving {Privacy} while {Broadcasting}: k-{Limited}-{Access} {Schemes}},\n year = {2017}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"karmoose-song-cardone-fragouli-privatebroadcastinganindexcodingapproach-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   M. Karmoose;  L. Song;  M. Cardone;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Private Broadcasting: an Index Coding Approach.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>, January 2017. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/karmoose-song-cardone-fragouli-privatebroadcastinganindexcodingapproach-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('karmoose-song-cardone-fragouli-privatebroadcastinganindexcodingapproach-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{karmoose_private_2017,\n type={4},\n author = {Karmoose, M. and Song, L. and Cardone, M. and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n month = {January},\n tags = {network_coding},\n title = {Private {Broadcasting}: an {Index} {Coding} {Approach}},\n year = {2017}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"song-srinivasavaradhan-fragouli-thebenefitofbeingflexibleindistributedcomputation-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Song;  SR Srinivasavaradhan;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  The Benefit of Being Flexible in Distributed Computation.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Information Theory Workshop (ITW)</i>,  2017. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/song-srinivasavaradhan-fragouli-thebenefitofbeingflexibleindistributedcomputation-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('song-srinivasavaradhan-fragouli-thebenefitofbeingflexibleindistributedcomputation-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{song_benefit_2017,\n type={4},\n author = {Song, L. and Srinivasavaradhan, SR and Fragouli, C.},\n booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},\n tags = {network_coding},\n title = {The {Benefit} of {Being} {Flexible} in {Distributed} {Computation}},\n year = {2017}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"song-fragouli-makingrecommendationsbandwidthaware-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Song;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Making recommendations bandwidth aware.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>,  2017. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/song-fragouli-makingrecommendationsbandwidthaware-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('song-fragouli-makingrecommendationsbandwidthaware-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{song_making_2017,\n type={4},\n author = {Song, L. and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n tags = {network_coding},\n title = {Making recommendations bandwidth aware},\n year = {2017}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"song-fragouli-apliableindexcodingapproachtodatashuffling-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Song;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A pliable index coding approach to data shuffling.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>,  2017. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/song-fragouli-apliableindexcodingapproachtodatashuffling-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('song-fragouli-apliableindexcodingapproachtodatashuffling-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{song_pliable_2017,\n type={4},\n author = {Song, L. and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n tags = {network_coding},\n title = {A pliable index coding approach to data shuffling},\n year = {2017}\n}\n\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"tsai-agarwal-fragouli-diggavi-adistortionbasedapproachforprotectinginferences-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   CY Tsai;  G. K. Agarwal;  C. Fragouli;  and  S. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Distortion Based Approach for Protecting Inferences.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium of Information Theory (ISIT)</i>, January 2017. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/tsai-agarwal-fragouli-diggavi-adistortionbasedapproachforprotectinginferences-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('tsai-agarwal-fragouli-diggavi-adistortionbasedapproachforprotectinginferences-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{tsai_distortion_2017,\n type={4},\n author = {Tsai, CY and Agarwal, G. K. and Fragouli, C. and Diggavi, S.},\n booktitle = {{IEEE} {International} {Symposium} of {Information} {Theory} ({ISIT})},\n month = {January},\n tags = {security},\n title = {A {Distortion} {Based} {Approach} for {Protecting} {Inferences}},\n year = {2017}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2016\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2016')\"\n      onkeypress=\"toggleGroup('group_2016')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2016</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"brahma-ozgur-fragouli-onthecomplexityofschedulinginhalfduplexdiamondnetworks-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Brahma;  A. Ozgur;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On the Complexity of Scheduling in Half-Duplex Diamond Networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>.  2016.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/brahma-ozgur-fragouli-onthecomplexityofschedulinginhalfduplexdiamondnetworks-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('brahma-ozgur-fragouli-onthecomplexityofschedulinginhalfduplexdiamondnetworks-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{brahma_complexity_2016,\n type={2},\n author = {Brahma, S. and Ozgur, A. and Fragouli, C.},\n journal = {IEEE Transactions on Information Theory},\n tags = {wireless},\n title = {On the {Complexity} of {Scheduling} in {Half}-{Duplex} {Diamond} {Networks}},\n year = {2016}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"czap-fragouli-prabhakaran-diggavi-anlpcharacterizationofthesecretmessagecapacityofthreeerasurenetworkswithfeedback-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Czap;  C. Fragouli;  V. M. Prabhakaran;  and  S. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  An LP Characterization of the Secret-message Capacity of Three Erasure Networks with Feedback.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>.  2016.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/czap-fragouli-prabhakaran-diggavi-anlpcharacterizationofthesecretmessagecapacityofthreeerasurenetworkswithfeedback-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('czap-fragouli-prabhakaran-diggavi-anlpcharacterizationofthesecretmessagecapacityofthreeerasurenetworkswithfeedback-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{czap_lp_2016,\n type={2},\n author = {Czap, L. and Fragouli, C. and Prabhakaran, V. M. and Diggavi, S.},\n journal = {IEEE Transactions on Information Theory},\n tags = {security},\n title = {An {LP} {Characterization} of the {Secret}-message {Capacity} of {Three} {Erasure} {Networks} with {Feedback}},\n year = {2016}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"safaka-czap-fragouli-argyraki-creatingsecretsoutofpacketerasures-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   I. Safaka;  L. Czap;  C. Fragouli;  and  K. Argyraki.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Creating secrets out of packet erasures.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Forensics &amp; Security</i>.  2016.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/safaka-czap-fragouli-argyraki-creatingsecretsoutofpacketerasures-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('safaka-czap-fragouli-argyraki-creatingsecretsoutofpacketerasures-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{safaka_creating_2016,\n type={2},\n author = {Safaka, I. and Czap, L. and Fragouli, C. and Argyraki, K.},\n journal = {IEEE Transactions on Information Forensics \\&amp;amp; Security},\n tags = {security},\n title = {Creating secrets out of packet erasures},\n year = {2016}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (6)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"agarwal-cardone-fragouli-onsecurenetworkcodingfortwounicastsessions-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   G. K. Agarwal;  M. Cardone;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On Secure Network Coding for Two Unicast Sessions.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>,  2016. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/agarwal-cardone-fragouli-onsecurenetworkcodingfortwounicastsessions-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('agarwal-cardone-fragouli-onsecurenetworkcodingfortwounicastsessions-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{agarwal_secure_2016,\n type={4},\n author = {Agarwal, G. K. and Cardone, M. and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n tags = {security},\n title = {On {Secure} {Network} {Coding} for {Two} {Unicast} {Sessions}},\n year = {2016}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"agarwal-cardone-fragouli-onsecurenetworkcodingfortwounicastsessionsstudyingbutterflies-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   G. K. Agarwal;  M. Cardone;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On secure network coding for two unicast sessions: studying butterflies.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Symposium on Network Coding (NetCod)</i>,  2016. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/agarwal-cardone-fragouli-onsecurenetworkcodingfortwounicastsessionsstudyingbutterflies-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('agarwal-cardone-fragouli-onsecurenetworkcodingfortwounicastsessionsstudyingbutterflies-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{agarwal_secure_2016-1,\n type={4},\n author = {Agarwal, G. K. and Cardone, M. and Fragouli, C.},\n booktitle = {{IEEE} {Symposium} on {Network} {Coding} ({NetCod})},\n tags = {security},\n title = {On secure network coding for two unicast sessions: studying butterflies},\n year = {2016}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cardone-fragouli-tuninetti-onnetworksimplificationforgaussianhalfduplexdiamondnetworks-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   M. Cardone;  C. Fragouli;  and  D. Tuninetti.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On Network Simplification for Gaussian Half-Duplex Diamond Networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>,  2016. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cardone-fragouli-tuninetti-onnetworksimplificationforgaussianhalfduplexdiamondnetworks-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cardone-fragouli-tuninetti-onnetworksimplificationforgaussianhalfduplexdiamondnetworks-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{cardone_network_2016,\n type={4},\n author = {Cardone, M. and Fragouli, C. and Tuninetti, D.},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n tags = {wireless},\n title = {On {Network} {Simplification} for {Gaussian} {Half}-{Duplex} {Diamond} {Networks}},\n year = {2016}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ezzeldin-sengupta-fragouli-wirelessnetworksimplificationbeyonddiamondnetworks-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Y. H. Ezzeldin;  A. Sengupta;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Wireless Network Simplification: Beyond Diamond Networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>,  2016. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ezzeldin-sengupta-fragouli-wirelessnetworksimplificationbeyonddiamondnetworks-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ezzeldin-sengupta-fragouli-wirelessnetworksimplificationbeyonddiamondnetworks-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{ezzeldin_wireless_2016,\n type={4},\n author = {Ezzeldin, Y. H. and Sengupta, A. and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n tags = {wireless},\n title = {Wireless {Network} {Simplification}: {Beyond} {Diamond} {Networks}},\n year = {2016}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"karmoose-cardone-fragouli-simplifyingwirelesssocialcaching-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   M. Karmoose;  M. Cardone;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Simplifying Wireless Social Caching.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>,  2016. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/karmoose-cardone-fragouli-simplifyingwirelesssocialcaching-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('karmoose-cardone-fragouli-simplifyingwirelesssocialcaching-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{karmoose_simplifying_2016,\n type={4},\n author = {Karmoose, M. and Cardone, M. and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n tags = {network_coding},\n title = {Simplifying {Wireless} {Social} {Caching}},\n year = {2016}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"song-fragouli-adeterministicalgorithmforpliableindexcoding-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Song;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Deterministic Algorithm for Pliable Index Coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>,  2016. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/song-fragouli-adeterministicalgorithmforpliableindexcoding-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('song-fragouli-adeterministicalgorithmforpliableindexcoding-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{song_deterministic_2016,\n type={4},\n author = {Song, L. and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n tags = {network_coding},\n title = {A {Deterministic} {Algorithm} for {Pliable} {Index} {Coding}},\n year = {2016}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2015\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2015')\"\n      onkeypress=\"toggleGroup('group_2015')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2015</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"brahma-fragouli-pliableindexcoding-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Brahma;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Pliable Index Coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>.  2015.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/brahma-fragouli-pliableindexcoding-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('brahma-fragouli-pliableindexcoding-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{brahma_pliable_2015,\n type={2},\n author = {Brahma, S. and Fragouli, C.},\n journal = {IEEE Transactions on Information Theory},\n tags = {network_coding},\n title = {Pliable {Index} {Coding}},\n year = {2015}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"czap-fragouli-prabhakaran-diggavi-secretcommunicationoverbroadcasterasurechannelswithstatefeedback-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Czap;  C. Fragouli;  V. M. Prabhakaran;  and  Suhas Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Secret communication over broadcast erasure channels with state-feedback.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>.  2015.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/czap-fragouli-prabhakaran-diggavi-secretcommunicationoverbroadcasterasurechannelswithstatefeedback-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('czap-fragouli-prabhakaran-diggavi-secretcommunicationoverbroadcasterasurechannelswithstatefeedback-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{czap_secret_2015,\n type={2},\n author = {Czap, L. and Fragouli, C. and Prabhakaran, V. M. and Diggavi, Suhas},\n journal = {IEEE Transactions on Information Theory},\n tags = {security},\n title = {Secret communication over broadcast erasure channels with state-feedback},\n year = {2015}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"czap-fragouli-prabhakaran-diggavi-securenetworkcodingwitherasuresandfeedback-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Czap;  C. Fragouli;  V. M. Prabhakaran;  and  Suhas Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Secure network coding with erasures and feedback.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>.  2015.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/czap-fragouli-prabhakaran-diggavi-securenetworkcodingwitherasuresandfeedback-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('czap-fragouli-prabhakaran-diggavi-securenetworkcodingwitherasuresandfeedback-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{czap_secure_2015,\n type={2},\n author = {Czap, L. and Fragouli, C. and Prabhakaran, V. M. and Diggavi, Suhas},\n journal = {IEEE Transactions on Information Theory},\n tags = {security},\n title = {Secure network coding with erasures and feedback},\n year = {2015}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"le-keller-seferoglu-cici-fragouli-markopoulou-microcastcooperativevideostreamingusingcellularandlocalconnections-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   A. Le;  L. Keller;  H. Seferoglu;  B. Cici;  C. Fragouli;  and  A. Markopoulou.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  MicroCast: Cooperative Video Streaming using Cellular and Local Connections.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Networking</i>.  2015.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/le-keller-seferoglu-cici-fragouli-markopoulou-microcastcooperativevideostreamingusingcellularandlocalconnections-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('le-keller-seferoglu-cici-fragouli-markopoulou-microcastcooperativevideostreamingusingcellularandlocalconnections-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{le_microcast_2015,\n type={2},\n author = {Le, A. and Keller, L. and Seferoglu, H. and Cici, B. and Fragouli, C. and Markopoulou, A.},\n journal = {IEEE Transactions on Networking},\n tags = {network_coding,wireless},\n title = {{MicroCast}: {Cooperative} {Video} {Streaming} using {Cellular} and {Local} {Connections}},\n year = {2015}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (6)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"fragouli-soljanin-securelinearnetworkcodingmulticastatheoreticalminimumandsomeopenproblems-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  and  E. Soljanin.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  (Secure) Linear network coding multicast A theoretical minimum and some open problems.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Designs, Codes and Cryptography, Springer Verlag</i>.  2015.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-soljanin-securelinearnetworkcodingmulticastatheoreticalminimumandsomeopenproblems-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-soljanin-securelinearnetworkcodingmulticastatheoreticalminimumandsomeopenproblems-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_secure_2015,\n type={4},\n author = {Fragouli, C. and Soljanin, E.},\n journal = {Designs, Codes and Cryptography, Springer Verlag},\n tags = {security},\n title = {({Secure}) {Linear} network coding multicast {A} theoretical minimum and some open problems},\n year = {2015}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-czap-prabhakaran-diggavi-wirelessnetworksecuritybuildingonerasures-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  L. Czap;  V. M. Prabhakaran;  and  Suhas Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Wireless network security: building on erasures.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>The Proceedings of the IEEE</i>.  2015.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-czap-prabhakaran-diggavi-wirelessnetworksecuritybuildingonerasures-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-czap-prabhakaran-diggavi-wirelessnetworksecuritybuildingonerasures-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_wireless_2015,\n type={4},\n author = {Fragouli, C. and Czap, L. and Prabhakaran, V. M. and Diggavi, Suhas},\n journal = {The Proceedings of the IEEE},\n tags = {security},\n title = {Wireless network security: building on erasures},\n year = {2015}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hosszu-fragouli-tapolcai-combinatorialerrordetectioninlinearencoders-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Eva Hosszu;  C. Fragouli;  and  Janos Tapolcai.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Combinatorial error detection in linear encoders.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE 16th International Conference on High Performance Switching and Routing (HPSR)</i>, July 2015. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hosszu-fragouli-tapolcai-combinatorialerrordetectioninlinearencoders-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hosszu-fragouli-tapolcai-combinatorialerrordetectioninlinearencoders-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{hosszu_combinatorial_2015,\n type={4},\n author = {Hosszu, Eva and Fragouli, C. and Tapolcai, Janos},\n booktitle = {{IEEE} 16th {International} {Conference} on {High} {Performance} {Switching} and {Routing} ({HPSR})},\n month = {July},\n tags = {channel_coding},\n title = {Combinatorial error detection in linear encoders},\n year = {2015}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"papadopoulos-czap-fragouli-lpformulationsforsecrecyovererasurenetworkswithfeedback-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   A. Papadopoulos;  L. Czap;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  LP formulations for secrecy over erasure networks with feedback.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Infromation Theory (ISIT)</i>,  2015. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/papadopoulos-czap-fragouli-lpformulationsforsecrecyovererasurenetworkswithfeedback-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('papadopoulos-czap-fragouli-lpformulationsforsecrecyovererasurenetworkswithfeedback-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{papadopoulos_lp_2015,\n type={4},\n author = {Papadopoulos, A. and Czap, L. and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} on {Infromation} {Theory} ({ISIT})},\n tags = {security},\n title = {{LP} formulations for secrecy over erasure networks with feedback},\n year = {2015}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"safaka-czap-argyraki-fragouli-towardsunconditionaltorlikeanonymity-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   I. Safaka;  L. Czap;  K. Argyraki;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Towards unconditional tor-like anonymity.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Symposium on Network Coding (NetCod)</i>, July 2015. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/safaka-czap-argyraki-fragouli-towardsunconditionaltorlikeanonymity-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('safaka-czap-argyraki-fragouli-towardsunconditionaltorlikeanonymity-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{safaka_towards_2015,\n type={4},\n author = {Safaka, I. and Czap, L. and Argyraki, K. and Fragouli, C.},\n booktitle = {{IEEE} {Symposium} on {Network} {Coding} ({NetCod})},\n month = {July},\n tags = {security},\n title = {Towards unconditional tor-like anonymity},\n year = {2015}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"song-fragouli-contenttypecoding-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Song;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Content-type coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Symposium on Network Coding (NetCod)</i>, July 2015. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/song-fragouli-contenttypecoding-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('song-fragouli-contenttypecoding-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{song_content-type_2015,\n type={4},\n author = {Song, L. and Fragouli, C.},\n booktitle = {{IEEE} {Symposium} on {Network} {Coding} ({NetCod})},\n month = {July},\n tags = {network_coding},\n title = {Content-type coding},\n year = {2015}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2014\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2014')\"\n      onkeypress=\"toggleGroup('group_2014')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2014</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"nazaroglu-ozgur-fragouli-wirelessnetworksimplificationthegaussiannrelaydiamondnetwork-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Nazaroglu;  A. Ozgur;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Wireless network simplification: the Gaussian N-Relay diamond network.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>.  2014.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/nazaroglu-ozgur-fragouli-wirelessnetworksimplificationthegaussiannrelaydiamondnetwork-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('nazaroglu-ozgur-fragouli-wirelessnetworksimplificationthegaussiannrelaydiamondnetwork-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{nazaroglu_wireless_2014,\n type={2},\n author = {Nazaroglu, C. and Ozgur, A. and Fragouli, C.},\n journal = {IEEE Transactions on Information Theory},\n tags = {wireless},\n title = {Wireless network simplification: the {Gaussian} {N}-{Relay} diamond network},\n year = {2014}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sengupta-wang-fragouli-cooperativerelayingatfinitesnrroleofquantizemapandforward-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   A. Sengupta;  I. -Hsiang Wang;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Cooperative relaying at finite SNR–role of Quantize-Map-and-Forward.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Wireless Communications</i>.  2014.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sengupta-wang-fragouli-cooperativerelayingatfinitesnrroleofquantizemapandforward-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sengupta-wang-fragouli-cooperativerelayingatfinitesnrroleofquantizemapandforward-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{sengupta_cooperative_2014,\n type={2},\n author = {Sengupta, A. and Wang, I. -Hsiang and Fragouli, C.},\n journal = {IEEE Transactions on Wireless Communications},\n tags = {wireless},\n title = {Cooperative relaying at finite {SNR}–role of {Quantize}-{Map}-and-{Forward}},\n year = {2014}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (8)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"brahma-sengupta-duartegelvez-fragouli-diggavi-quiltadecodequantizeinterleavetransmitapproachtocooperativerelaying-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Brahma;  A. Sengupta;  Melissa Duarte Gelvez;  C. Fragouli;  and  Suhas Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  QUILT: A decode/quantize-interleave-transmit approach to cooperative relaying.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE INFOCOM</i>,  2014. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/brahma-sengupta-duartegelvez-fragouli-diggavi-quiltadecodequantizeinterleavetransmitapproachtocooperativerelaying-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('brahma-sengupta-duartegelvez-fragouli-diggavi-quiltadecodequantizeinterleavetransmitapproachtocooperativerelaying-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{brahma_quilt_2014,\n type={4},\n author = {Brahma, S. and Sengupta, A. and Duarte Gelvez, Melissa and Fragouli, C. and Diggavi, Suhas},\n booktitle = {{IEEE} {INFOCOM}},\n tags = {wireless},\n title = {{QUILT}: {A} decode/quantize-interleave-transmit approach to cooperative relaying},\n year = {2014}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"brahma-fragouli-asimplerelayingstrategyfordiamondnetworks-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Brahma;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A simple relaying strategy for diamond networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>,  2014. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/brahma-fragouli-asimplerelayingstrategyfordiamondnetworks-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('brahma-fragouli-asimplerelayingstrategyfordiamondnetworks-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{brahma_simple_2014,\n type={4},\n author = {Brahma, S. and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n tags = {wireless},\n title = {A simple relaying strategy for diamond networks},\n year = {2014}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"brahma-fragouli-structureofoptimalschedulesindiamondnetworks-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Brahma;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Structure of optimal schedules in diamond networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>,  2014. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/brahma-fragouli-structureofoptimalschedulesindiamondnetworks-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('brahma-fragouli-structureofoptimalschedulesindiamondnetworks-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{brahma_structure_2014,\n type={4},\n author = {Brahma, S. and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n tags = {wireless},\n title = {Structure of optimal schedules in diamond networks},\n year = {2014}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"brahma-sengupta-fragouli-switchedlocalschedulesfordiamondnetworks-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Brahma;  A. Sengupta;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Switched local schedules for diamond networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Information Theory Workshop (ITW)</i>,  2014. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/brahma-sengupta-fragouli-switchedlocalschedulesfordiamondnetworks-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('brahma-sengupta-fragouli-switchedlocalschedulesfordiamondnetworks-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{brahma_switched_2014,\n type={4},\n author = {Brahma, S. and Sengupta, A. and Fragouli, C.},\n booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},\n tags = {wireless},\n title = {Switched local schedules for diamond networks},\n year = {2014}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"czap-prabhakaran-diggavi-fragouli-trianglenetworksecrecy-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Czap;  V. M. Prabhakaran;  Suhas Diggavi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Triangle network secrecy.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>,  2014. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/czap-prabhakaran-diggavi-fragouli-trianglenetworksecrecy-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('czap-prabhakaran-diggavi-fragouli-trianglenetworksecrecy-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{czap_triangle_2014,\n type={4},\n author = {Czap, L. and Prabhakaran, V. M. and Diggavi, Suhas and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n tags = {security},\n title = {Triangle network secrecy},\n year = {2014}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"papadopoulos-czap-fragouli-achievablesecrecyinarbitraryerasurenetworkswithfeedback-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   A. Papadopoulos;  L. Czap;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Achievable secrecy in arbitrary erasure networks with feedback.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Global Conference on Signal and Information Processing (GlobalSIP)</i>, December 2014. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/papadopoulos-czap-fragouli-achievablesecrecyinarbitraryerasurenetworkswithfeedback-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('papadopoulos-czap-fragouli-achievablesecrecyinarbitraryerasurenetworkswithfeedback-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{papadopoulos_achievable_2014,\n type={4},\n author = {Papadopoulos, A. and Czap, L. and Fragouli, C.},\n booktitle = {{IEEE} {Global} {Conference} on {Signal} and {Information} {Processing} ({GlobalSIP})},\n month = {December},\n tags = {security},\n title = {Achievable secrecy in arbitrary erasure networks with feedback},\n year = {2014}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"papadopoulos-czap-fragouli-secretmessagecapacityofalinenetwork-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   A. Papadopoulos;  L. Czap;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Secret message capacity of a line network.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Annual Allerton Conference on Communication, Control and Computing (Allerton)</i>, September 2014. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/papadopoulos-czap-fragouli-secretmessagecapacityofalinenetwork-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('papadopoulos-czap-fragouli-secretmessagecapacityofalinenetwork-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{papadopoulos_secret_2014,\n type={4},\n author = {Papadopoulos, A. and Czap, L. and Fragouli, C.},\n booktitle = {Annual {Allerton} {Conference} on {Communication}, {Control} and {Computing} ({Allerton})},\n month = {September},\n tags = {security},\n title = {Secret message capacity of a line network},\n year = {2014}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sengupta-brahma-fragouli-efficientsubnetworkselectioninrelaynetworks-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   A. Sengupta;  S. Brahma;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Efficient subnetwork selection in relay networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>,  2014. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sengupta-brahma-fragouli-efficientsubnetworkselectioninrelaynetworks-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sengupta-brahma-fragouli-efficientsubnetworkselectioninrelaynetworks-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{sengupta_efficient_2014,\n type={4},\n author = {Sengupta, A. and Brahma, S. and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n tags = {wireless},\n title = {Efficient subnetwork selection in relay networks},\n year = {2014}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2013\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2013')\"\n      onkeypress=\"toggleGroup('group_2013')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2013</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"keller-atsan-argyraki-fragouli-sensecodenetworkcodingforreliablesensornetworks-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Keller;  Emre Atsan;  K. Argyraki;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  SenseCode: Network Coding for Reliable Sensor Networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Sensor Networks</i>.  2013.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/keller-atsan-argyraki-fragouli-sensecodenetworkcodingforreliablesensornetworks-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('keller-atsan-argyraki-fragouli-sensecodenetworkcodingforreliablesensornetworks-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{keller_sensecode_2013,\n type={2},\n author = {Keller, L. and Atsan, Emre and Argyraki, K. and Fragouli, C.},\n journal = {IEEE Transactions on Sensor Networks},\n tags = {sensor_networks},\n title = {{SenseCode}: {Network} {Coding} for {Reliable} {Sensor} {Networks}},\n year = {2013}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"markopoulou-gjoka-fragouli-anetworkcodingapproachtonetworktomography-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   A. Markopoulou;  M. Gjoka;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A network coding approach to network tomography.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>.  2013.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/markopoulou-gjoka-fragouli-anetworkcodingapproachtonetworktomography-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('markopoulou-gjoka-fragouli-anetworkcodingapproachtonetworktomography-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{markopoulou_network_2013,\n type={2},\n author = {Markopoulou, A. and Gjoka, M. and Fragouli, C.},\n journal = {IEEE Transactions on Information Theory},\n tags = {network_coding},\n title = {A network coding approach to network tomography},\n year = {2013}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (10)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"argyraki-diggavi-duartegelvez-fragouli-gkatzianas-kostopoulos-creatingsecretsoutoferasures-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   K. Argyraki;  Suhas Diggavi;  Melissa Duarte Gelvez;  C. Fragouli;  Marios Apostolos Gkatzianas;  and  Panagiotis Kostopoulos.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Creating Secrets out of Erasures.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the ACM Conference on Mobile Computing and Networking (MobiCom)</i>,  2013. \n  <span class=\"note\">event-place: Miami, Florida, USA</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1145/2500423.2500440\"\n     onclick=\"log_download('argyraki-diggavi-duartegelvez-fragouli-gkatzianas-kostopoulos-creatingsecretsoutoferasures-2013', 'http://doi.org/10.1145/2500423.2500440', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/argyraki-diggavi-duartegelvez-fragouli-gkatzianas-kostopoulos-creatingsecretsoutoferasures-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('argyraki-diggavi-duartegelvez-fragouli-gkatzianas-kostopoulos-creatingsecretsoutoferasures-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{argyraki_creating_2013,\n abstract = {Current security systems often rely on the adversary&#x27;s computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary&#x27;s limited network presence (i.e., that the adversary cannot be located at many different points in the network at the same time). We present a system that leverages this opportunity to enable N wireless nodes to create a shared secret S, in a way that an eavesdropper, Eve, obtains very little information on S. Our system consists of two steps: (1) The nodes transmit packets following a special pattern, such that Eve learns very little about a given fraction of the transmitted packets. This is achieved through a combination of beam forming (from many different sources) and wiretap codes. (2) The nodes participate in a protocol that reshuffles the information known to each node, such that the nodes end up sharing a secret that Eve knows very little about. Our protocol is easily implementable in existing wireless devices and scales well with the number of nodes; these properties are achieved through a combination of public feedback, broadcasting, and network coding. We evaluate our system through a 5-node testbed. We demonstrate that a group of wireless nodes can generate thousands of new shared secret bits per second, with their secrecy being independent of the adversary&#x27;s computational capabilities.},\n type={4},\n author = {Argyraki, K. and Diggavi, Suhas and Duarte Gelvez, Melissa and Fragouli, C. and Gkatzianas, Marios Apostolos and Kostopoulos, Panagiotis},\n booktitle = {Proceedings of the {ACM} {Conference} on {Mobile} {Computing} and {Networking} ({MobiCom})},\n doi = {10.1145/2500423.2500440},\n keywords = {Group secret agreement, Physical-layer security},\n note = {event-place: Miami, Florida, USA},\n tags = {security},\n title = {Creating {Secrets} out of {Erasures}},\n year = {2013}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Current security systems often rely on the adversary's computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary's limited network presence (i.e., that the adversary cannot be located at many different points in the network at the same time). We present a system that leverages this opportunity to enable N wireless nodes to create a shared secret S, in a way that an eavesdropper, Eve, obtains very little information on S. Our system consists of two steps: (1) The nodes transmit packets following a special pattern, such that Eve learns very little about a given fraction of the transmitted packets. This is achieved through a combination of beam forming (from many different sources) and wiretap codes. (2) The nodes participate in a protocol that reshuffles the information known to each node, such that the nodes end up sharing a secret that Eve knows very little about. Our protocol is easily implementable in existing wireless devices and scales well with the number of nodes; these properties are achieved through a combination of public feedback, broadcasting, and network coding. We evaluate our system through a 5-node testbed. We demonstrate that a group of wireless nodes can generate thousands of new shared secret bits per second, with their secrecy being independent of the adversary's computational capabilities.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"atsan-safaka-keller-fragouli-lowcostsecurityforsensornetworks-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Emre Atsan;  I. Safaka;  L. Keller;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Low cost security for sensor networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 2013 IEEE International Symposium on Network Coding (NetCod)</i>,  2013. \n  <span class=\"note\">event-place: Calgary, Canada</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/atsan-safaka-keller-fragouli-lowcostsecurityforsensornetworks-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('atsan-safaka-keller-fragouli-lowcostsecurityforsensornetworks-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{atsan_low_2013,\n abstract = {We design and evaluate a lightweight encryption protocol suitable for sensor networks, that enables weak security in the presence of passive eavesdroppers. At every communication round, our protocol creates a key between each sensor node and the sink, by appropriately mixing and coding information packets that the nodes passively overhear. Evaluation using the TOSSIM simulator indicates that with our protocol we can gain significant security benefits at low overhead cost.},\n type={4},\n author = {Atsan, Emre and Safaka, I. and Keller, L. and Fragouli, C.},\n booktitle = {Proceedings of the 2013 {IEEE} {International} {Symposium} on {Network} {Coding} ({NetCod})},\n keywords = {information-theoretic security, Sensor networks, Week security},\n note = {event-place: Calgary, Canada},\n tags = {security,sensor_networks},\n title = {Low cost security for sensor networks},\n year = {2013}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We design and evaluate a lightweight encryption protocol suitable for sensor networks, that enables weak security in the presence of passive eavesdroppers. At every communication round, our protocol creates a key between each sensor node and the sink, by appropriately mixing and coding information packets that the nodes passively overhear. Evaluation using the TOSSIM simulator indicates that with our protocol we can gain significant security benefits at low overhead cost.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"brahma-fragouli-pliableindexcodingthemultiplerequestscase-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Brahma;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Pliable Index Coding - The Multiple Requests Case.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the IEEE International Symposium on Infromation Theory (ISIT)</i>,  2013. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/brahma-fragouli-pliableindexcodingthemultiplerequestscase-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('brahma-fragouli-pliableindexcodingthemultiplerequestscase-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{brahma_pliable_2013,\n type={4},\n author = {Brahma, S. and Fragouli, C.},\n booktitle = {Proceedings of the {IEEE} {International} {Symposium} on {Infromation} {Theory} ({ISIT})},\n tags = {network_coding},\n title = {Pliable {Index} {Coding} - {The} {Multiple} {Requests} {Case}},\n year = {2013}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"brahma-fragouli-ozgur-onthestructureofapproximatelyoptimalschedulesforhalfduplexdiamondnetworks-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Brahma;  C. Fragouli;  and  A. Ozgur.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On the structure of approximately optimal schedules for half-duplex diamond networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the Annual Allerton Conference on Communication, Control, and Computing</i>,  2013. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/brahma-fragouli-ozgur-onthestructureofapproximatelyoptimalschedulesforhalfduplexdiamondnetworks-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('brahma-fragouli-ozgur-onthestructureofapproximatelyoptimalschedulesforhalfduplexdiamondnetworks-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{brahma_structure_2013,\n type={4},\n author = {Brahma, S. and Fragouli, C. and Ozgur, A.},\n booktitle = {Proceedings of the {Annual} {Allerton} {Conference} on {Communication}, {Control}, and {Computing}},\n tags = {wireless},\n title = {On the structure of approximately optimal schedules for half-duplex diamond networks},\n year = {2013}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"czap-prabhakaran-diggavi-fragouli-exploitingcommonrandomnessaresourcefornetworksecrecy-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Czap;  V. M. Prabhakaran;  S. Diggavi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Exploiting Common Randomness: a Resource for Network Secrecy.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Information Theory Workshop (ITW)</i>,  2013. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/czap-prabhakaran-diggavi-fragouli-exploitingcommonrandomnessaresourcefornetworksecrecy-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('czap-prabhakaran-diggavi-fragouli-exploitingcommonrandomnessaresourcefornetworksecrecy-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{czap_exploiting_2013,\n type={4},\n author = {Czap, L. and Prabhakaran, V. M. and Diggavi, S. and Fragouli, C.},\n booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},\n tags = {security},\n title = {Exploiting {Common} {Randomness}: a {Resource} for {Network} {Secrecy}},\n year = {2013}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"czap-fragouli-prabhakaran-diggavi-securenetworkcodingwitherasuresandfeedback-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Czap;  C. Fragouli;  V. M. Prabhakaran;  and  Suhas Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Secure Network Coding with Erasures and Feedback.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Annual Allerton Conference on Communication, Control, and Computing</i>,  2013. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/czap-fragouli-prabhakaran-diggavi-securenetworkcodingwitherasuresandfeedback-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('czap-fragouli-prabhakaran-diggavi-securenetworkcodingwitherasuresandfeedback-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{czap_secure_2013,\n type={4},\n author = {Czap, L. and Fragouli, C. and Prabhakaran, V. M. and Diggavi, Suhas},\n booktitle = {Annual {Allerton} {Conference} on {Communication}, {Control}, and {Computing}},\n tags = {security},\n title = {Secure {Network} {Coding} with {Erasures} and {Feedback}},\n year = {2013}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"czap-prabhakaran-diggavi-fragouli-securingbroadcastagainstdishonestreceivers-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Czap;  V. M. Prabhakaran;  S. Diggavi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Securing Broadcast Against Dishonest Receivers.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Symposium on Network Coding (NetCod)</i>,  2013. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/czap-prabhakaran-diggavi-fragouli-securingbroadcastagainstdishonestreceivers-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('czap-prabhakaran-diggavi-fragouli-securingbroadcastagainstdishonestreceivers-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{czap_securing_2013,\n type={4},\n author = {Czap, L. and Prabhakaran, V. M. and Diggavi, S. and Fragouli, C.},\n booktitle = {{IEEE} {Symposium} on {Network} {Coding} ({NetCod})},\n tags = {security},\n title = {Securing {Broadcast} {Against} {Dishonest} {Receivers}},\n year = {2013}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"duartegelvez-sengupta-brahma-fragouli-diggavi-quantizemapforwardqmfrelayinganexperimentalstudy-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Melissa Duarte Gelvez;  A. Sengupta;  S. Brahma;  C. Fragouli;  and  S. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Quantize-Map-Forward (QMF) Relaying - An Experimental Study.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>ACM MOBIHOC</i>,  2013. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/duartegelvez-sengupta-brahma-fragouli-diggavi-quantizemapforwardqmfrelayinganexperimentalstudy-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('duartegelvez-sengupta-brahma-fragouli-diggavi-quantizemapforwardqmfrelayinganexperimentalstudy-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{duarte_gelvez_quantize-map-forward_2013,\n type={4},\n author = {Duarte Gelvez, Melissa and Sengupta, A. and Brahma, S. and Fragouli, C. and Diggavi, S.},\n booktitle = {{ACM} {MOBIHOC}},\n tags = {wireless},\n title = {Quantize-{Map}-{Forward} ({QMF}) {Relaying} - {An} {Experimental} {Study}},\n year = {2013}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"onaran-gatzianas-fragouli-broadcasterasurechannelwithfeedbackthetwomulticastcasealgorithmsandbounds-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Efe Onaran;  Marios Gatzianas;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Broadcast erasure channel with feedback: the two multicast case - algorithms and bounds.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Symposium on Network Coding (NetCod)</i>, June 2013. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/onaran-gatzianas-fragouli-broadcasterasurechannelwithfeedbackthetwomulticastcasealgorithmsandbounds-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('onaran-gatzianas-fragouli-broadcasterasurechannelwithfeedbackthetwomulticastcasealgorithmsandbounds-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{onaran_broadcast_2013,\n type={4},\n author = {Onaran, Efe and Gatzianas, Marios and Fragouli, C.},\n booktitle = {{IEEE} {Symposium} on {Network} {Coding} ({NetCod})},\n month = {June},\n tags = {wireless},\n title = {Broadcast erasure channel with feedback: the two multicast case - algorithms and bounds},\n year = {2013}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"safaka-fragouli-argyraki-diggavi-exchangingpairwisesecretsefficiently-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   I. Safaka;  C. Fragouli;  K. Argyraki;  and  Suhas Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Exchanging Pairwise Secrets Efficiently.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 32nd Annual IEEE International Conference on Computer Communications (INFOCOM)</i>,  2013. \n  <span class=\"note\">event-place: Turin, Italy</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/safaka-fragouli-argyraki-diggavi-exchangingpairwisesecretsefficiently-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('safaka-fragouli-argyraki-diggavi-exchangingpairwisesecretsefficiently-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{safaka_exchanging_2013,\n abstract = {We consider the problem where a group of wireless nodes, connected to the same broadcast domain, want to create pairwise secrets, in the presence of an adversary Eve, who tries to listen in and steal these secrets. Existing solutions assume that Eve cannot perform certain computations (e.g., large-integer factorization) in useful time. We ask the question: can we solve this problem without assuming anything about Eve&#x27;s computational capabilities? We propose a simple secret-agreement protocol, where the wireless nodes keep exchanging bits until they have agreed on pairwise secrets that Eve cannot reconstruct with very high probability. Our protocol relies on Eve&#x27;s limited network presence (the fact that she cannot be located at an arbitrary number of points in the network at the same time), but assumes nothing about her computational capabilities. We formally show that, under standard theoretical assumptions, our protocol is information-theoretically secure (it leaks zero information to Eve about the secrets). Using a small wireless testbed of smartphones, we provide experimental evidence that it is feasible for 5 nodes to create thousands of secret bits per second, with their secrecy being independent from the adversary&#x27;s capabilities.},\n type={4},\n author = {Safaka, I. and Fragouli, C. and Argyraki, K. and Diggavi, Suhas},\n booktitle = {Proceedings of the 32nd {Annual} {IEEE} {International} {Conference} on {Computer} {Communications} ({INFOCOM})},\n keywords = {information-theoretic security, Pairwise secrets},\n note = {event-place: Turin, Italy},\n tags = {security},\n title = {Exchanging {Pairwise} {Secrets} {Efficiently}},\n year = {2013}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider the problem where a group of wireless nodes, connected to the same broadcast domain, want to create pairwise secrets, in the presence of an adversary Eve, who tries to listen in and steal these secrets. Existing solutions assume that Eve cannot perform certain computations (e.g., large-integer factorization) in useful time. We ask the question: can we solve this problem without assuming anything about Eve's computational capabilities? We propose a simple secret-agreement protocol, where the wireless nodes keep exchanging bits until they have agreed on pairwise secrets that Eve cannot reconstruct with very high probability. Our protocol relies on Eve's limited network presence (the fact that she cannot be located at an arbitrary number of points in the network at the same time), but assumes nothing about her computational capabilities. We formally show that, under standard theoretical assumptions, our protocol is information-theoretically secure (it leaks zero information to Eve about the secrets). Using a small wireless testbed of smartphones, we provide experimental evidence that it is feasible for 5 nodes to create thousands of secret bits per second, with their secrecy being independent from the adversary's capabilities.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2012\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2012')\"\n      onkeypress=\"toggleGroup('group_2012')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2012</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"siavoshani-fragouli-diggavi-subspacepropertiesofnetworkcodingandtheirapplications-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   M. J. Siavoshani;  C. Fragouli;  and  S. N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Subspace properties of network coding and their applications.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Information Theory, IEEE Transactions on</i>, 58(5): 2599–2619.  2012.\n  <span class=\"note\">Publisher: IEEE</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/siavoshani-fragouli-diggavi-subspacepropertiesofnetworkcodingandtheirapplications-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('siavoshani-fragouli-diggavi-subspacepropertiesofnetworkcodingandtheirapplications-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{siavoshani_subspace_2012,\n type={2},\n author = {Siavoshani, M. J. and Fragouli, C. and Diggavi, S. N.},\n journal = {Information Theory, IEEE Transactions on},\n note = {Publisher: IEEE},\n number = {5},\n pages = {2599--2619},\n tags = {network_coding},\n title = {Subspace properties of network coding and their applications},\n volume = {58},\n year = {2012}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (17)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"gatzianas-saeedi-fragouli-feedbackbasedcodingalgorithmsforbroadcasterasurechannelswithdegradedmessagesets-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Marios Gatzianas;  Shirin Saeedi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Feedback-based coding algorithms for broadcast erasure channels with degraded message sets.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings NETCOD</i>, June 2012. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gatzianas-saeedi-fragouli-feedbackbasedcodingalgorithmsforbroadcasterasurechannelswithdegradedmessagesets-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gatzianas-saeedi-fragouli-feedbackbasedcodingalgorithmsforbroadcasterasurechannelswithdegradedmessagesets-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{gatzianas_feedback-based_2012,\n type={4},\n author = {Gatzianas, Marios and Saeedi, Shirin and Fragouli, C.},\n booktitle = {Proceedings {NETCOD}},\n month = {June},\n tags = {wireless,network_coding},\n title = {Feedback-based coding algorithms for broadcast erasure channels with degraded message sets},\n year = {2012}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"atsan-knopp-diggavi-fragouli-towardsintegratingquantizemapforwardrelayingintolte-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Emre Atsan;  Raymond Knopp;  Suhas N. Diggavi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Towards integrating Quantize-Map-Forward relaying into LTE.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Information Theory Workshop (ITW)</i>,  2012. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/atsan-knopp-diggavi-fragouli-towardsintegratingquantizemapforwardrelayingintolte-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('atsan-knopp-diggavi-fragouli-towardsintegratingquantizemapforwardrelayingintolte-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{atsan_towards_2012,\n abstract = {We present a method to integrate the Quantize-Map-Forward (QMF) relaying scheme into the standard LTE operation, for a two-relay diamond network configuration. Our approach implements QMF using mainly existing LTE modules and functionalities, and results in minimal changes in the standard link-layer LTE operation. In particular, the destination operation is only affected in that we adapt the log-likelihood ratio (LLR) calculations at the decoder input to take into account the existence of relays; thus, the decoding complexity and operations (apart the LLR calculations) are not modified. We report extensive performance evaluations of our scheme using the OpenAirInterface (OAI) link-level simulation tools.},\n type={4},\n author = {Atsan, Emre and Knopp, Raymond and Diggavi, Suhas N. and Fragouli, C.},\n booktitle = {Information {Theory} {Workshop} ({ITW})},\n publisher = {IEEE},\n tags = {wireless},\n title = {Towards integrating {Quantize}-{Map}-{Forward} relaying into {LTE}},\n year = {2012}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We present a method to integrate the Quantize-Map-Forward (QMF) relaying scheme into the standard LTE operation, for a two-relay diamond network configuration. Our approach implements QMF using mainly existing LTE modules and functionalities, and results in minimal changes in the standard link-layer LTE operation. In particular, the destination operation is only affected in that we adapt the log-likelihood ratio (LLR) calculations at the decoder input to take into account the existence of relays; thus, the decoding complexity and operations (apart the LLR calculations) are not modified. We report extensive performance evaluations of our scheme using the OpenAirInterface (OAI) link-level simulation tools.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"brahma-fragouli-pliableindexcoding-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Brahma;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Pliable index coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on</i>, pages 2251–2255,  2012. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/brahma-fragouli-pliableindexcoding-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('brahma-fragouli-pliableindexcoding-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{brahma_pliable_2012,\n type={4},\n author = {Brahma, S. and Fragouli, C.},\n booktitle = {Information {Theory} {Proceedings} ({ISIT}), 2012 {IEEE} {International} {Symposium} on},\n pages = {2251--2255},\n publisher = {IEEE},\n tags = {network_coding},\n title = {Pliable index coding},\n year = {2012}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"brahma-ozgur-fragouli-simpleschedulesforhalfduplexnetworks-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Brahma;  A. Ozgur;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Simple schedules for half-duplex networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on</i>, pages 1112–1116,  2012. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/brahma-ozgur-fragouli-simpleschedulesforhalfduplexnetworks-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('brahma-ozgur-fragouli-simpleschedulesforhalfduplexnetworks-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{brahma_simple_2012,\n type={4},\n author = {Brahma, S. and Ozgur, A. and Fragouli, C.},\n booktitle = {Information {Theory} {Proceedings} ({ISIT}), 2012 {IEEE} {International} {Symposium} on},\n pages = {1112--1116},\n publisher = {IEEE},\n tags = {wireless},\n title = {Simple schedules for half-duplex networks},\n year = {2012}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"buyukalp-maatouk-prabhakaran-fragouli-untrustingnetworkcoding-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Y. Buyukalp;  G. Maatouk;  V. M. Prabhakaran;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Untrusting network coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Network Coding (NetCod), 2012 International Symposium on</i>, pages 79–84,  2012. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/buyukalp-maatouk-prabhakaran-fragouli-untrustingnetworkcoding-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('buyukalp-maatouk-prabhakaran-fragouli-untrustingnetworkcoding-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{buyukalp_untrusting_2012,\n type={4},\n author = {Buyukalp, Y. and Maatouk, G. and Prabhakaran, V. M. and Fragouli, C.},\n booktitle = {Network {Coding} ({NetCod}), 2012 {International} {Symposium} on},\n pages = {79--84},\n publisher = {IEEE},\n tags = {network_coding,security},\n title = {Untrusting network coding},\n year = {2012}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"czap-prabhakaran-diggavi-fragouli-broadcastingprivatemessagessecurely-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Czap;  V. M. Prabhakaran;  Suhas N. Diggavi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Broadcasting Private Messages Securely.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>, February 2012. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/czap-prabhakaran-diggavi-fragouli-broadcastingprivatemessagessecurely-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('czap-prabhakaran-diggavi-fragouli-broadcastingprivatemessagessecurely-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{czap_broadcasting_2012,\n type={4},\n author = {Czap, L. and Prabhakaran, V. M. and Diggavi, Suhas N. and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n month = {February},\n publisher = {IEEE},\n tags = {security},\n title = {Broadcasting {Private} {Messages} {Securely}},\n year = {2012}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"czap-prabhakaran-fragouli-diggavi-encryptandmixunconditionallyoptimalsecurewirelessbroadcast-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Czap;  V. M. Prabhakaran;  C. Fragouli;  and  S. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Encrypt and mix: unconditionally optimal secure wireless broadcast.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>In submission</i>,  2012. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/czap-prabhakaran-fragouli-diggavi-encryptandmixunconditionallyoptimalsecurewirelessbroadcast-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('czap-prabhakaran-fragouli-diggavi-encryptandmixunconditionallyoptimalsecurewirelessbroadcast-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{czap_encrypt_2012,\n type={4},\n author = {Czap, L. and Prabhakaran, V. M. and Fragouli, C. and Diggavi, S.},\n booktitle = {In submission},\n tags = {security},\n title = {Encrypt and mix: unconditionally optimal secure wireless broadcast},\n year = {2012}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"drinea-keller-fragouli-realtimedelaywithnetworkcodingandfeedback-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Eleni Drinea;  L. Keller;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.sciencedirect.com/science/article/pii/S1874490712000444\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'drinea-keller-fragouli-realtimedelaywithnetworkcodingandfeedback-2012', 'http://www.sciencedirect.com/science/article/pii/S1874490712000444', event);\">\n    Real-time delay with network coding and feedback.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Physical Communication</i>, (0).  2012.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.sciencedirect.com/science/article/pii/S1874490712000444\"\n     onclick=\"log_download('drinea-keller-fragouli-realtimedelaywithnetworkcodingandfeedback-2012', 'http://www.sciencedirect.com/science/article/pii/S1874490712000444', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Real-time delay with network coding and feedback [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1016/j.phycom.2012.05.005\"\n     onclick=\"log_download('drinea-keller-fragouli-realtimedelaywithnetworkcodingandfeedback-2012', 'http://doi.org/10.1016/j.phycom.2012.05.005', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/drinea-keller-fragouli-realtimedelaywithnetworkcodingandfeedback-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('drinea-keller-fragouli-realtimedelaywithnetworkcodingandfeedback-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{drinea_real-time_2012,\n type={4},\n author = {Drinea, Eleni and Keller, L. and Fragouli, C.},\n doi = {10.1016/j.phycom.2012.05.005},\n issn = {1874-4907},\n journal = {Physical Communication},\n keywords = {Delay},\n number = {0},\n tags = {network_coding},\n title = {Real-time delay with network coding and feedback},\n url = {http://www.sciencedirect.com/science/article/pii/S1874490712000444},\n year = {2012}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ebrahimi-fragouli-propertiesofnetworkpolynomials-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   J. B. Ebrahimi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Properties of network polynomials.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on</i>, pages 1306–1310,  2012. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ebrahimi-fragouli-propertiesofnetworkpolynomials-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ebrahimi-fragouli-propertiesofnetworkpolynomials-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{ebrahimi_properties_2012,\n type={4},\n author = {Ebrahimi, J. B. and Fragouli, C.},\n booktitle = {Information {Theory} {Proceedings} ({ISIT}), 2012 {IEEE} {International} {Symposium} on},\n pages = {1306--1310},\n publisher = {IEEE},\n tags = {network_coding},\n title = {Properties of network polynomials},\n year = {2012}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gatzianas-saeedi-fragouli-feedbackbasedcodingalgorithmsforbroadcasterasurechannelswithdegradedmessagesets-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Marios Gatzianas;  Shirin Saeedi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Feedback-based coding algorithms for broadcast erasure channels with degraded message sets.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings NETCOD</i>, June 2012. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gatzianas-saeedi-fragouli-feedbackbasedcodingalgorithmsforbroadcasterasurechannelswithdegradedmessagesets-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gatzianas-saeedi-fragouli-feedbackbasedcodingalgorithmsforbroadcasterasurechannelswithdegradedmessagesets-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{gatzianas_feedback-based_2012,\n type={4},\n author = {Gatzianas, Marios and Saeedi, Shirin and Fragouli, C.},\n booktitle = {Proceedings {NETCOD}},\n month = {June},\n tags = {wireless,network_coding},\n title = {Feedback-based coding algorithms for broadcast erasure channels with degraded message sets},\n year = {2012}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"karamchandani-keller-fragouli-franceschetti-functioncomputationviasubspacecoding-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Nikhil Karamchandani;  L. Keller;  C. Fragouli;  and  Massimo Franceschetti.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.sciencedirect.com/science/article/pii/S1874490712000201\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'karamchandani-keller-fragouli-franceschetti-functioncomputationviasubspacecoding-2012', 'http://www.sciencedirect.com/science/article/pii/S1874490712000201', event);\">\n    Function computation via subspace coding.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Physical Communication</i>, (0).  2012.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.sciencedirect.com/science/article/pii/S1874490712000201\"\n     onclick=\"log_download('karamchandani-keller-fragouli-franceschetti-functioncomputationviasubspacecoding-2012', 'http://www.sciencedirect.com/science/article/pii/S1874490712000201', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Function computation via subspace coding [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1016/j.phycom.2012.02.007\"\n     onclick=\"log_download('karamchandani-keller-fragouli-franceschetti-functioncomputationviasubspacecoding-2012', 'http://doi.org/10.1016/j.phycom.2012.02.007', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/karamchandani-keller-fragouli-franceschetti-functioncomputationviasubspacecoding-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('karamchandani-keller-fragouli-franceschetti-functioncomputationviasubspacecoding-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{karamchandani_function_2012,\n abstract = {This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.},\n type={4},\n author = {Karamchandani, Nikhil and Keller, L. and Fragouli, C. and Franceschetti, Massimo},\n doi = {10.1016/j.phycom.2012.02.007},\n issn = {1874-4907},\n journal = {Physical Communication},\n keywords = {Wireless sensor network},\n number = {0},\n tags = {sensor_networks},\n title = {Function computation via subspace coding},\n url = {http://www.sciencedirect.com/science/article/pii/S1874490712000201},\n year = {2012}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"keller-le-cici-seferoglu-fragouli-markopoulou-microcastcooperativevideostreamingonsmartphones-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Keller;  A. Le;  B. Cici;  H. Seferoglu;  C. Fragouli;  and  A. Markopoulou.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Microcast: Cooperative video streaming on smartphones.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 10th international conference on Mobile systems, applications, and services</i>, pages 57–70,  2012. ACM\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/keller-le-cici-seferoglu-fragouli-markopoulou-microcastcooperativevideostreamingonsmartphones-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('keller-le-cici-seferoglu-fragouli-markopoulou-microcastcooperativevideostreamingonsmartphones-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{keller_microcast_2012,\n abstract = {Video streaming is one of the increasingly popular, as well as demanding, applications on smartphones today. In this paper, we consider a group of smartphone users, within proximity of each other, who are interested in watching the same video from the Internet at the same time. The common practice today is that each user downloads the video independently using her own cellular connection, which often leads to poor quality. We design, implement, and evaluate a novel system, MicroCast, that uses the resources on all smartphones of the group in a cooperative way so as to improve the streaming experience. Each 4 phone uses simultaneously two network interfaces: the cellular to connect to the video server and the WiFi to connect to the rest of the group. Key ingredients of our design include the following. First, we propose a scheduling algorithm, MicroDownload, that decides which parts of the video each phone should download from the server, based on the phones’ download rate. Second, we propose a novel all-to-all local dissemination scheme, MicroNC-P2, for sharing content among group members, which outperforms state-of-the-art peer-to-peer schemes in our setting. MicroNC-P2 is designed to exploit WiFi overhearing and network coding, based on a local packet broadcast framework, MicroBroadcast, which we developed specifically for Android phones. We evaluate MicroCast on a testbed consisting of seven Android phones, and we show that it brings significant performance benefits without battery penalty.},\n type={4},\n author = {Keller, L. and Le, A. and Cici, B. and Seferoglu, H. and Fragouli, C. and Markopoulou, A.},\n booktitle = {Proceedings of the 10th international conference on {Mobile} systems, applications, and services},\n pages = {57--70},\n publisher = {ACM},\n tags = {network_coding,wireless},\n title = {Microcast: {Cooperative} video streaming on smartphones},\n year = {2012}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Video streaming is one of the increasingly popular, as well as demanding, applications on smartphones today. In this paper, we consider a group of smartphone users, within proximity of each other, who are interested in watching the same video from the Internet at the same time. The common practice today is that each user downloads the video independently using her own cellular connection, which often leads to poor quality. We design, implement, and evaluate a novel system, MicroCast, that uses the resources on all smartphones of the group in a cooperative way so as to improve the streaming experience. Each 4 phone uses simultaneously two network interfaces: the cellular to connect to the video server and the WiFi to connect to the rest of the group. Key ingredients of our design include the following. First, we propose a scheduling algorithm, MicroDownload, that decides which parts of the video each phone should download from the server, based on the phones’ download rate. Second, we propose a novel all-to-all local dissemination scheme, MicroNC-P2, for sharing content among group members, which outperforms state-of-the-art peer-to-peer schemes in our setting. MicroNC-P2 is designed to exploit WiFi overhearing and network coding, based on a local packet broadcast framework, MicroBroadcast, which we developed specifically for Android phones. We evaluate MicroCast on a testbed consisting of seven Android phones, and we show that it brings significant performance benefits without battery penalty.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"le-keller-fragouli-markopoulou-microplayanetworkingframeworkforlocalmultiplayergames-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   A. Le;  L. Keller;  C. Fragouli;  and  A. Markopoulou.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  MicroPlay: a networking framework for local multiplayer games.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the first ACM international workshop on Mobile gaming</i>, pages 13–18,  2012. ACM\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/le-keller-fragouli-markopoulou-microplayanetworkingframeworkforlocalmultiplayergames-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('le-keller-fragouli-markopoulou-microplayanetworkingframeworkforlocalmultiplayergames-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{le_microplay_2012,\n abstract = {Smartphones are an ideal platform for local multiplayer games, thanks to their computational and networking capabilities as well as their popularity and portability. However, existing game engines do not exploit the locality of players to improve game latency. In this paper, we propose MicroPlay, a complete networking framework for local multiplayer mobile games. To the best of our knowledge, this is the first framework that exploits local connections between smartphones, and in particular, the broadcast nature of the wireless medium, to provide smooth, accurate rendering of all players with two desired properties. First, it performs direct-input rendering (i.e., without any inter- or extrapo- lation of game state) for all players; second, it provides very low game latency. We implement a MicroPlay prototype on Android phones, as well as an example multiplayer car racing game, called Racer, in order to demonstrate MicroPlay’s capabilities. Our experiments show that cars can be rendered smoothly, without any prediction of state, and with only 20–30 ms game latency.},\n type={4},\n author = {Le, A. and Keller, L. and Fragouli, C. and Markopoulou, A.},\n booktitle = {Proceedings of the first {ACM} international workshop on {Mobile} gaming},\n pages = {13--18},\n publisher = {ACM},\n tags = {network_coding,wireless},\n title = {{MicroPlay}: a networking framework for local multiplayer games},\n year = {2012}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Smartphones are an ideal platform for local multiplayer games, thanks to their computational and networking capabilities as well as their popularity and portability. However, existing game engines do not exploit the locality of players to improve game latency. In this paper, we propose MicroPlay, a complete networking framework for local multiplayer mobile games. To the best of our knowledge, this is the first framework that exploits local connections between smartphones, and in particular, the broadcast nature of the wireless medium, to provide smooth, accurate rendering of all players with two desired properties. First, it performs direct-input rendering (i.e., without any inter- or extrapo- lation of game state) for all players; second, it provides very low game latency. We implement a MicroPlay prototype on Android phones, as well as an example multiplayer car racing game, called Racer, in order to demonstrate MicroPlay’s capabilities. Our experiments show that cars can be rendered smoothly, without any prediction of state, and with only 20–30 ms game latency.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"safaka-fragouli-argyraki-diggavi-creatingsharedsecretsoutofthinair-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   I. Safaka;  C. Fragouli;  K. Argyraki;  and  Suhas Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Creating shared secrets out of thin air.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 11th ACM Workshop on Hot Topics in Networks</i>, of <i>HotNets-XI</i>, pages 73–78, New York, NY, USA,  2012. ACM\n  <span class=\"note\">event-place: Redmond, Washington</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1145/2390231.2390244\"\n     onclick=\"log_download('safaka-fragouli-argyraki-diggavi-creatingsharedsecretsoutofthinair-2012', 'http://doi.org/10.1145/2390231.2390244', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/safaka-fragouli-argyraki-diggavi-creatingsharedsecretsoutofthinair-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('safaka-fragouli-argyraki-diggavi-creatingsharedsecretsoutofthinair-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{safaka_creating_2012,\n address = {New York, NY, USA},\n type={4},\n author = {Safaka, I. and Fragouli, C. and Argyraki, K. and Diggavi, Suhas},\n booktitle = {Proceedings of the 11th {ACM} {Workshop} on {Hot} {Topics} in {Networks}},\n doi = {10.1145/2390231.2390244},\n isbn = {978-1-4503-1776-4},\n keywords = {information-theoretic security, group secrets},\n note = {event-place: Redmond, Washington},\n pages = {73--78},\n publisher = {ACM},\n series = {{HotNets}-{XI}},\n tags = {security},\n title = {Creating shared secrets out of thin air},\n year = {2012}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sattari-fragouli-markopoulou-activetopologyinferenceusingnetworkcoding-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   P. Sattari;  C. Fragouli;  and  A. Markopoulou.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Active topology inference using network coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Physical Communication</i>.  2012.\n  <span class=\"note\">Publisher: Elsevier</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sattari-fragouli-markopoulou-activetopologyinferenceusingnetworkcoding-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sattari-fragouli-markopoulou-activetopologyinferenceusingnetworkcoding-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{sattari_active_2012,\n type={4},\n author = {Sattari, P. and Fragouli, C. and Markopoulou, A.},\n journal = {Physical Communication},\n note = {Publisher: Elsevier},\n tags = {network_coding},\n title = {Active topology inference using network coding},\n year = {2012}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sengupta-wang-fragouli-optimizingquantizemapandforwardinslowfadingrelaynetworks-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Ayan Sengupta;  I. -Hsiang Wang;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Optimizing Quantize-Map-and-Forward in Slow Fading Relay Networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>2012 50Th Annual Allerton Conference On Communication, Control, And Computing (Allerton)</i>, pages 1928–1934, New York,  2012. Ieee\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sengupta-wang-fragouli-optimizingquantizemapandforwardinslowfadingrelaynetworks-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sengupta-wang-fragouli-optimizingquantizemapandforwardinslowfadingrelaynetworks-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{sengupta_optimizing_2012,\n abstract = {Quantize-Map-and-Forward (QMF) relaying has been shown to achieve the optimal diversity-multiplexing trade-off (DMT) for the slow fading single-antenna relay channel, regardless of whether the relay is full-duplex or half-duplex. A key reason for the DMT optimality is that quantizing at the noise level suffices to achieve the cut-set bound approximately and hence the relay does not need any instantaneous channel state information (CSI). However, DMT only captures the high SNR performance and potentially, limited CSI at the relay can help improve the performance in moderate SNR regimes. In this work we propose an optimization framework for QMF relaying in slow fading relay channels. Focusing on vector Gaussian quantizers, for the full-duplex relay we optimize the outage probability by finding the best quantization level according to the available CSI at the relay and the channel statistics. For the half-duplex relay we find good relay schedules using the same framework. Numerical evaluations show the improvement of taking the CSI into account over noise-level quantization and static schedules in moderate SNR regimes.},\n address = {New York},\n type={4},\n author = {Sengupta, Ayan and Wang, I. -Hsiang and Fragouli, C.},\n booktitle = {2012 {50Th} {Annual} {Allerton} {Conference} {On} {Communication}, {Control}, {And} {Computing} ({Allerton})},\n isbn = {978-1-4673-4539-2},\n pages = {1928--1934},\n publisher = {Ieee},\n tags = {wireless},\n title = {Optimizing {Quantize}-{Map}-and-{Forward} in {Slow} {Fading} {Relay} {Networks}},\n year = {2012}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Quantize-Map-and-Forward (QMF) relaying has been shown to achieve the optimal diversity-multiplexing trade-off (DMT) for the slow fading single-antenna relay channel, regardless of whether the relay is full-duplex or half-duplex. A key reason for the DMT optimality is that quantizing at the noise level suffices to achieve the cut-set bound approximately and hence the relay does not need any instantaneous channel state information (CSI). However, DMT only captures the high SNR performance and potentially, limited CSI at the relay can help improve the performance in moderate SNR regimes. In this work we propose an optimization framework for QMF relaying in slow fading relay channels. Focusing on vector Gaussian quantizers, for the full-duplex relay we optimize the outage probability by finding the best quantization level according to the available CSI at the relay and the channel statistics. For the half-duplex relay we find good relay schedules using the same framework. Numerical evaluations show the improvement of taking the CSI into account over noise-level quantization and static schedules in moderate SNR regimes.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"siavoshani-fragouli-multiterminalsecrecyinalinearnoncoherentpacketizednetworks-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   M. J. Siavoshani;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Multi-terminal secrecy in a linear non-coherent packetized networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Network Coding (NetCod), 2012 International Symposium on</i>, pages 85–90,  2012. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/siavoshani-fragouli-multiterminalsecrecyinalinearnoncoherentpacketizednetworks-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('siavoshani-fragouli-multiterminalsecrecyinalinearnoncoherentpacketizednetworks-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{siavoshani_multi-terminal_2012,\n type={4},\n author = {Siavoshani, M. J. and Fragouli, C.},\n booktitle = {Network {Coding} ({NetCod}), 2012 {International} {Symposium} on},\n pages = {85--90},\n publisher = {IEEE},\n tags = {network_coding,wireless},\n title = {Multi-terminal secrecy in a linear non-coherent packetized networks},\n year = {2012}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2011\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2011')\"\n      onkeypress=\"toggleGroup('group_2011')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2011</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (5)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"ebrahimi-fragouli-algorithmsforvectornetworkcoding-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Javad Ebrahimi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Algorithms for vector network coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory (Special Issue on Facets of Coding Theory: from Algorithms to Networks)</i>.  2011.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ebrahimi-fragouli-algorithmsforvectornetworkcoding-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ebrahimi-fragouli-algorithmsforvectornetworkcoding-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{ebrahimi_algorithms_2011,\n abstract = {We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L x L coding matrices that play a similar role as coding coefficients in scalar coding. We start our work by extending the algebraic framework developed for multicasting over graphs in [1] to include operations over matrices; we build on this generalized framework, to provide a new approach for both scalar and vector code design which attempts to minimize the employed field size and employed vector length, while selecting the coding operations. Our algorithms also lead as a special case to network code designs that employ structured matrices.},\n type={2},\n author = {Ebrahimi, Javad and Fragouli, C.},\n journal = {IEEE Transactions on Information Theory (Special Issue on Facets of Coding Theory: from Algorithms to Networks)},\n tags = {network_coding},\n title = {Algorithms for vector network coding},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L x L coding matrices that play a similar role as coding coefficients in scalar coding. We start our work by extending the algebraic framework developed for multicasting over graphs in [1] to include operations over matrices; we build on this generalized framework, to provide a new approach for both scalar and vector code design which attempts to minimize the employed field size and employed vector length, while selecting the coding operations. Our algorithms also lead as a special case to network code designs that employ structured matrices.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ebrahimi-fragouli-combinatorialalgorithmsforwirelessinformationflow-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Javad Ebrahimi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Combinatorial algorithms for wireless information flow.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>ACM Transactions on Algorithms</i>.  2011.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ebrahimi-fragouli-combinatorialalgorithmsforwirelessinformationflow-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ebrahimi-fragouli-combinatorialalgorithmsforwirelessinformationflow-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{ebrahimi_combinatorial_2011,\n abstract = {A long-standing open question in information theory is to characterize the unicast capacity of a wireless relay network. The difficulty arises due to the complex signal interactions induced in the network, since the wireless channel inherently broadcasts the signals and there is interference among transmissions. Recently, Avestimehr, Diggavi and Tse proposed a linear deterministic model that takes into account the shared nature of wireless channels, focusing on the signal interactions rather than the background noise. They generalized the min-cut max-flow theorem for graphs to networks of deterministic channels and proved that the capacity can be achieved using information theoretical tools. They showed that the value of the minimum cut is in this case the minimum rank of all the adjacency matrices describing source-destination cuts. In this paper, we develop a polynomial time algorithm that discovers the relay encoding strategy to achieve the min-cut value in linear deterministic (wireless) networks, for the case of a unicast connection. Our algorithm crucially uses a notion of linear independence between channels to calculate the capacity in polynomial time. Moreover, we can achieve the capacity by using very simple one-symbol processing at the intermediate nodes, thereby constructively yielding finite length strategies that achieve the unicast capacity of the linear deterministic (wireless) relay network.},\n type={2},\n author = {Ebrahimi, Javad and Fragouli, C.},\n journal = {ACM Transactions on Algorithms},\n tags = {network_coding,wireless},\n title = {Combinatorial algorithms for wireless information flow},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  A long-standing open question in information theory is to characterize the unicast capacity of a wireless relay network. The difficulty arises due to the complex signal interactions induced in the network, since the wireless channel inherently broadcasts the signals and there is interference among transmissions. Recently, Avestimehr, Diggavi and Tse proposed a linear deterministic model that takes into account the shared nature of wireless channels, focusing on the signal interactions rather than the background noise. They generalized the min-cut max-flow theorem for graphs to networks of deterministic channels and proved that the capacity can be achieved using information theoretical tools. They showed that the value of the minimum cut is in this case the minimum rank of all the adjacency matrices describing source-destination cuts. In this paper, we develop a polynomial time algorithm that discovers the relay encoding strategy to achieve the min-cut value in linear deterministic (wireless) networks, for the case of a unicast connection. Our algorithm crucially uses a notion of linear independence between channels to calculate the capacity in polynomial time. Moreover, we can achieve the capacity by using very simple one-symbol processing at the intermediate nodes, thereby constructively yielding finite length strategies that achieve the unicast capacity of the linear deterministic (wireless) relay network.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-networkcodingbeyondthroughputbenefits-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Network coding: beyond throughput benefits.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Special Issue on Network Coding at the Proceedings of the IEEE</i>.  2011.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-networkcodingbeyondthroughputbenefits-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-networkcodingbeyondthroughputbenefits-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_network_2011,\n type={2},\n author = {Fragouli, C.},\n journal = {Special Issue on Network Coding at the Proceedings of the IEEE},\n tags = {network_coding},\n title = {Network coding: beyond throughput benefits},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"jafarisiavoshani-mohajer-fragouli-diggavi-onthecapacityofnoncoherentnetworkcoding-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Mahdi Jafari Siavoshani;  Soheil Mohajer;  C. Fragouli;  and  Suhas N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On the capacity of non-coherent network coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory (Special Issue on Facets of Coding Theory: from Algorithms to Networks)</i>, 57(2): 1046–1066. February 2011.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/jafarisiavoshani-mohajer-fragouli-diggavi-onthecapacityofnoncoherentnetworkcoding-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('jafarisiavoshani-mohajer-fragouli-diggavi-onthecapacityofnoncoherentnetworkcoding-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{jafari_siavoshani_capacity_2011,\n abstract = {We consider the problem of multicasting information from a source to a set of receivers over a network where intermediate network nodes perform randomized network coding operations on the source packets. We propose a channel model for the non-coherent network coding introduced by Koetter and Kschischang in [6], that captures the essence of such a network operation, and calculate the capacity as a function of network parameters. We prove that use of subspace coding is optimal, and show that, in some cases, the capacity-achieving distribution uses subspaces of several dimensions, where the employed dimensions depend on the packet length. This model and the results also allow us to give guidelines on when subspace coding is beneficial for the proposed model and by how much, in comparison to a coding vector approach, from a capacity viewpoint. We extend our results to the case of multiple source multicast that creates a virtual multiple access channel.},\n type={2},\n author = {Jafari Siavoshani, Mahdi and Mohajer, Soheil and Fragouli, C. and Diggavi, Suhas N.},\n journal = {IEEE Transactions on Information Theory (Special Issue on Facets of Coding Theory: from Algorithms to Networks)},\n month = {February},\n number = {2},\n pages = {1046--1066},\n tags = {network_coding},\n title = {On the capacity of non-coherent network coding},\n volume = {57},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider the problem of multicasting information from a source to a set of receivers over a network where intermediate network nodes perform randomized network coding operations on the source packets. We propose a channel model for the non-coherent network coding introduced by Koetter and Kschischang in [6], that captures the essence of such a network operation, and calculate the capacity as a function of network parameters. We prove that use of subspace coding is optimal, and show that, in some cases, the capacity-achieving distribution uses subspaces of several dimensions, where the employed dimensions depend on the packet length. This model and the results also allow us to give guidelines on when subspace coding is beneficial for the proposed model and by how much, in comparison to a coding vector approach, from a capacity viewpoint. We extend our results to the case of multiple source multicast that creates a virtual multiple access channel.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"mohajer-diggavi-fragouli-tse-approximatecapacityofaclassofrelayinterferencenetworks-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Mohajer;  Suhas N. Diggavi;  C. Fragouli;  and  D. Tse.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Approximate capacity of a class of relay-interference networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 57(5): 2837–2864. May 2011.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mohajer-diggavi-fragouli-tse-approximatecapacityofaclassofrelayinterferencenetworks-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mohajer-diggavi-fragouli-tse-approximatecapacityofaclassofrelayinterferencenetworks-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{mohajer_approximate_2011,\n type={2},\n author = {Mohajer, S. and Diggavi, Suhas N. and Fragouli, C. and Tse, D.},\n journal = {IEEE Transactions on Information Theory},\n month = {May},\n number = {5},\n pages = {2837--2864},\n tags = {wireless},\n title = {Approximate capacity of a class of relay-interference networks},\n volume = {57},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (16)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"keller-karaagac-fragouli-argyraki-anetworkcodingapproachtothesniperdetectionproblem-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Keller;  A. Karaagac;  C. Fragouli;  and  K. Argyraki.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A network coding approach to the sniper detection problem.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Wireless Measurements Workshop (WinMee)</i>, May 2011. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/keller-karaagac-fragouli-argyraki-anetworkcodingapproachtothesniperdetectionproblem-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('keller-karaagac-fragouli-argyraki-anetworkcodingapproachtothesniperdetectionproblem-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{keller_network_2011,\n abstract = {This paper experimentally studies the reliability and delay of flooding based multicast protocols for a sniper detection application. In particular using an emulator it studies under which conditions protocols based on network coding deliver performance improvements compared to classic flooding. It then presents an implementation of such protocols on mobile phones.},\n type={4},\n author = {Keller, L. and Karaagac, A. and Fragouli, C. and Argyraki, K.},\n booktitle = {{IEEE} {Wireless} {Measurements} {Workshop} ({WinMee})},\n month = {May},\n tags = {wireless, network_coding},\n title = {A network coding approach to the sniper detection problem},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper experimentally studies the reliability and delay of flooding based multicast protocols for a sniper detection application. In particular using an emulator it studies under which conditions protocols based on network coding deliver performance improvements compared to classic flooding. It then presents an implementation of such protocols on mobile phones.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"saeedi-fragouli-degradedtwomessagemulticastovergraphs-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Shirin Saeedi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Degraded two-message multicast over graphs.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>, August 2011. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/saeedi-fragouli-degradedtwomessagemulticastovergraphs-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('saeedi-fragouli-degradedtwomessagemulticastovergraphs-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{saeedi_degraded_2011,\n type={4},\n author = {Saeedi, Shirin and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n month = {August},\n tags = {channel_coding,network_coding},\n title = {Degraded two-message multicast over graphs},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"seferoglu-keller-markopoulou-fragouli-smartcastcooperativevideostreamingonsmartphones-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   H. Seferoglu;  L. Keller;  Athina Markopoulou;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  SmartCast: Cooperative video streaming on smartphones.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Allerton Conference on Communications, Control and Computing</i>,  2011. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/seferoglu-keller-markopoulou-fragouli-smartcastcooperativevideostreamingonsmartphones-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('seferoglu-keller-markopoulou-fragouli-smartcastcooperativevideostreamingonsmartphones-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{seferoglu_smartcast_2011,\n abstract = {Video applications are increasingly popular over smartphones. However, in current cellular systems, the downlink data rate fluctuates and the loss rate can be quite high. We are interested in the scenario where a group of smartphone users, within proximity of each other, are interested in viewing the same video at the same time and are also willing to cooperate with each other. We propose a system that maximizes the video quality by appropriately using all available resources, namely the cellular connections to the phones as well as the device-to-device links that can be established via Bluetooth or WiFi. Key ingredients of our design are: (i) the cooperation among users, (ii) network coding, and (iii) exploiting broadcast in the mobile-to-mobile links. Our approach is grounded on a network utility maximization formulation of the problem. We present numerical results that demonstrate the benefit of our approach, and we implement a prototype on android phones.},\n type={4},\n author = {Seferoglu, H. and Keller, L. and Markopoulou, Athina and Fragouli, C.},\n booktitle = {{IEEE} {Allerton} {Conference} on {Communications}, {Control} and {Computing}},\n tags = {wireless,network_coding},\n title = {{SmartCast}: {Cooperative} video streaming on smartphones},\n year = {2011}\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Video applications are increasingly popular over smartphones. However, in current cellular systems, the downlink data rate fluctuates and the loss rate can be quite high. We are interested in the scenario where a group of smartphone users, within proximity of each other, are interested in viewing the same video at the same time and are also willing to cooperate with each other. We propose a system that maximizes the video quality by appropriately using all available resources, namely the cellular connections to the phones as well as the device-to-device links that can be established via Bluetooth or WiFi. Key ingredients of our design are: (i) the cooperation among users, (ii) network coding, and (iii) exploiting broadcast in the mobile-to-mobile links. Our approach is grounded on a network utility maximization formulation of the problem. We present numerical results that demonstrate the benefit of our approach, and we implement a prototype on android phones.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"venkatesan-iliadis-fragouli-urbanke-reliabilityofclusteredvsdeclusteredreplicaplacementindatastoragesystems-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Vinodh Venkatesan;  Ilias Iliadis;  C. Fragouli;  and  R. Urbanke.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Reliability of clustered vs. declustered replica placement in data storage systems.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)</i>, August 2011. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/venkatesan-iliadis-fragouli-urbanke-reliabilityofclusteredvsdeclusteredreplicaplacementindatastoragesystems-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('venkatesan-iliadis-fragouli-urbanke-reliabilityofclusteredvsdeclusteredreplicaplacementindatastoragesystems-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{venkatesan_reliability_2011,\n type={4},\n author = {Venkatesan, Vinodh and Iliadis, Ilias and Fragouli, C. and Urbanke, R.},\n booktitle = {{IEEE} {International} {Symposium} on {Modeling}, {Analysis} and {Simulation} of {Computer} and {Telecommunication} {Systems} ({MASCOTS})},\n month = {August},\n tags = {storage},\n title = {Reliability of clustered vs. declustered replica placement in data storage systems},\n year = {2011}\n}\n\n\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"czap-prabhakaran-fragouli-diggavi-secretmessagecapacityoferasurebroadcastchannelswithfeedback-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Czap;  V. M. Prabhakaran;  C. Fragouli;  and  Suhas N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Secret message capacity of erasure broadcast channels with feedback.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Information Theory Workshop (ITW)</i>,  2011. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/czap-prabhakaran-fragouli-diggavi-secretmessagecapacityoferasurebroadcastchannelswithfeedback-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('czap-prabhakaran-fragouli-diggavi-secretmessagecapacityoferasurebroadcastchannelswithfeedback-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{czap_secret_2011,\n type={4},\n author = {Czap, L. and Prabhakaran, V. M. and Fragouli, C. and Diggavi, Suhas N.},\n booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},\n tags = {security},\n title = {Secret message capacity of erasure broadcast channels with feedback},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"czap-fragouli-onsecurekeyexchangeinwirelessnetworks-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Czap;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On secure key exchange in wireless networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Network Coding (NetCod)</i>, July 2011. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/czap-fragouli-onsecurekeyexchangeinwirelessnetworks-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('czap-fragouli-onsecurekeyexchangeinwirelessnetworks-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{czap_secure_2011,\n type={4},\n author = {Czap, L. and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} on {Network} {Coding} ({NetCod})},\n month = {July},\n tags = {security},\n title = {On secure key exchange in wireless networks},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"georghiu-saeedi-fragouli-toledo-degradedmulticastingwithnetworkcodingoverthecombinationnetwork-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Georghiu;  Shirin Saeedi;  C. Fragouli;  and  A. Toledo.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Degraded multicasting with network coding over the combination network.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Network Coding (NetCod)</i>,  2011. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/georghiu-saeedi-fragouli-toledo-degradedmulticastingwithnetworkcodingoverthecombinationnetwork-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('georghiu-saeedi-fragouli-toledo-degradedmulticastingwithnetworkcodingoverthecombinationnetwork-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{georghiu_degraded_2011,\n type={4},\n author = {Georghiu, S. and Saeedi, Shirin and Fragouli, C. and Toledo, A.},\n booktitle = {{IEEE} {International} {Symposium} on {Network} {Coding} ({NetCod})},\n tags = {network_coding},\n title = {Degraded multicasting with network coding over the combination network},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"jafarisiavoshani-mishra-diggavi-fragouli-groupsecretkeyagreementoverstatedependentwirelessbroadcastchannels-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Mahdi Jafari Siavoshani;  Shaunak Mishra;  Suhas N. Diggavi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Group secret key agreement over state-dependent wireless broadcast channels.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>, August 2011. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/jafarisiavoshani-mishra-diggavi-fragouli-groupsecretkeyagreementoverstatedependentwirelessbroadcastchannels-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('jafarisiavoshani-mishra-diggavi-fragouli-groupsecretkeyagreementoverstatedependentwirelessbroadcastchannels-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{jafari_siavoshani_group_2011,\n type={4},\n author = {Jafari Siavoshani, Mahdi and Mishra, Shaunak and Diggavi, Suhas N. and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n month = {August},\n tags = {security},\n title = {Group secret key agreement over state-dependent wireless broadcast channels},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"keller-karaagac-fragouli-argyraki-anetworkcodingapproachtothesniperdetectionproblem-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Keller;  A. Karaagac;  C. Fragouli;  and  K. Argyraki.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A network coding approach to the sniper detection problem.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Wireless Measurements Workshop (WinMee)</i>, May 2011. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/keller-karaagac-fragouli-argyraki-anetworkcodingapproachtothesniperdetectionproblem-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('keller-karaagac-fragouli-argyraki-anetworkcodingapproachtothesniperdetectionproblem-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{keller_network_2011,\n abstract = {This paper experimentally studies the reliability and delay of flooding based multicast protocols for a sniper detection application. In particular using an emulator it studies under which conditions protocols based on network coding deliver performance improvements compared to classic flooding. It then presents an implementation of such protocols on mobile phones.},\n type={4},\n author = {Keller, L. and Karaagac, A. and Fragouli, C. and Argyraki, K.},\n booktitle = {{IEEE} {Wireless} {Measurements} {Workshop} ({WinMee})},\n month = {May},\n tags = {network_coding,wireless},\n title = {A network coding approach to the sniper detection problem},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper experimentally studies the reliability and delay of flooding based multicast protocols for a sniper detection application. In particular using an emulator it studies under which conditions protocols based on network coding deliver performance improvements compared to classic flooding. It then presents an implementation of such protocols on mobile phones.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"nazaroglu-ozgur-ebrahimi-fragouli-networksimplificationthegaussiandiamondnetworkwithmultipleantennas-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Nazaroglu;  A. Ozgur;  Javad Ebrahimi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Network simplification: the Gaussian diamond network with Multiple Antennas.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>, August 2011. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/nazaroglu-ozgur-ebrahimi-fragouli-networksimplificationthegaussiandiamondnetworkwithmultipleantennas-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('nazaroglu-ozgur-ebrahimi-fragouli-networksimplificationthegaussiandiamondnetworkwithmultipleantennas-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{nazaroglu_network_2011,\n type={4},\n author = {Nazaroglu, C. and Ozgur, A. and Ebrahimi, Javad and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n month = {August},\n tags = {wireless},\n title = {Network simplification: the {Gaussian} diamond network with {Multiple} {Antennas}},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"neuberg-papadimitratos-fragouli-urbanke-amobileworldofsecurity-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Neuberg;  P. Papadimitratos;  C. Fragouli;  and  R. Urbanke.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A mobile world of security.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>CISS</i>, March 2011. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/neuberg-papadimitratos-fragouli-urbanke-amobileworldofsecurity-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('neuberg-papadimitratos-fragouli-urbanke-amobileworldofsecurity-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{neuberg_mobile_2011,\n type={4},\n author = {Neuberg, C. and Papadimitratos, P. and Fragouli, C. and Urbanke, R.},\n booktitle = {{CISS}},\n month = {March},\n tags = {security},\n title = {A mobile world of security},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"saeedi-fragouli-degradedtwomessagemulticastovergraphs-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Shirin Saeedi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Degraded two-message multicast over graphs.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>, August 2011. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/saeedi-fragouli-degradedtwomessagemulticastovergraphs-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('saeedi-fragouli-degradedtwomessagemulticastovergraphs-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{saeedi_degraded_2011,\n type={4},\n author = {Saeedi, Shirin and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n month = {August},\n tags = {channel_coding,network_coding},\n title = {Degraded two-message multicast over graphs},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sattari-markopoulou-fragouli-maximumlikelihoodestimationformultiplesourcelosstomographywithnetworkcoding-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   P. Sattari;  Athina Markopoulou;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Maximum likelihood estimation for multiple-source loss tomography with network coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Network Coding (NetCod)</i>,  2011. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sattari-markopoulou-fragouli-maximumlikelihoodestimationformultiplesourcelosstomographywithnetworkcoding-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sattari-markopoulou-fragouli-maximumlikelihoodestimationformultiplesourcelosstomographywithnetworkcoding-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{sattari_maximum_2011,\n type={4},\n author = {Sattari, P. and Markopoulou, Athina and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} on {Network} {Coding} ({NetCod})},\n tags = {network_coding},\n title = {Maximum likelihood estimation for multiple-source loss tomography with network coding},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"seferoglu-keller-markopoulou-fragouli-smartcastcooperativevideostreamingonsmartphones-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   H. Seferoglu;  L. Keller;  Athina Markopoulou;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  SmartCast: Cooperative video streaming on smartphones.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Allerton Conference on Communications, Control and Computing</i>,  2011. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/seferoglu-keller-markopoulou-fragouli-smartcastcooperativevideostreamingonsmartphones-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('seferoglu-keller-markopoulou-fragouli-smartcastcooperativevideostreamingonsmartphones-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{seferoglu_smartcast_2011,\n abstract = {Video applications are increasingly popular over smartphones. However, in current cellular systems, the downlink data rate fluctuates and the loss rate can be quite high. We are interested in the scenario where a group of smartphone users, within proximity of each other, are interested in viewing the same video at the same time and are also willing to cooperate with each other. We propose a system that maximizes the video quality by appropriately using all available resources, namely the cellular connections to the phones as well as the device-to-device links that can be established via Bluetooth or WiFi. Key ingredients of our design are: (i) the cooperation among users, (ii) network coding, and (iii) exploiting broadcast in the mobile-to-mobile links. Our approach is grounded on a network utility maximization formulation of the problem. We present numerical results that demonstrate the benefit of our approach, and we implement a prototype on android phones.},\n type={4},\n author = {Seferoglu, H. and Keller, L. and Markopoulou, Athina and Fragouli, C.},\n booktitle = {{IEEE} {Allerton} {Conference} on {Communications}, {Control} and {Computing}},\n tags = {wireless,network_coding},\n title = {{SmartCast}: {Cooperative} video streaming on smartphones},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Video applications are increasingly popular over smartphones. However, in current cellular systems, the downlink data rate fluctuates and the loss rate can be quite high. We are interested in the scenario where a group of smartphone users, within proximity of each other, are interested in viewing the same video at the same time and are also willing to cooperate with each other. We propose a system that maximizes the video quality by appropriately using all available resources, namely the cellular connections to the phones as well as the device-to-device links that can be established via Bluetooth or WiFi. Key ingredients of our design are: (i) the cooperation among users, (ii) network coding, and (iii) exploiting broadcast in the mobile-to-mobile links. Our approach is grounded on a network utility maximization formulation of the problem. We present numerical results that demonstrate the benefit of our approach, and we implement a prototype on android phones.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sengupta-brahma-ozgur-fragouli-diggavi-graphbasedcodesforquantizemapandforwardrelaying-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   A. Sengupta;  S. Brahma;  A. Ozgur;  C. Fragouli;  and  S. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Graph-based codes for Quantize-Map-and-Forward relaying.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Information Theory Workshop (ITW), 2011 IEEE</i>, pages 140–144,  2011. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sengupta-brahma-ozgur-fragouli-diggavi-graphbasedcodesforquantizemapandforwardrelaying-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sengupta-brahma-ozgur-fragouli-diggavi-graphbasedcodesforquantizemapandforwardrelaying-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{sengupta_graph-based_2011,\n type={4},\n author = {Sengupta, A. and Brahma, S. and Ozgur, A. and Fragouli, C. and Diggavi, S.},\n booktitle = {Information {Theory} {Workshop} ({ITW}), 2011 {IEEE}},\n pages = {140--144},\n publisher = {IEEE},\n tags = {wireless},\n title = {Graph-based codes for {Quantize}-{Map}-and-{Forward} relaying},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"venkatesan-iliadis-fragouli-urbanke-reliabilityofclusteredvsdeclusteredreplicaplacementindatastoragesystems-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Vinodh Venkatesan;  Ilias Iliadis;  C. Fragouli;  and  R. Urbanke.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Reliability of clustered vs. declustered replica placement in data storage systems.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)</i>, August 2011. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/venkatesan-iliadis-fragouli-urbanke-reliabilityofclusteredvsdeclusteredreplicaplacementindatastoragesystems-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('venkatesan-iliadis-fragouli-urbanke-reliabilityofclusteredvsdeclusteredreplicaplacementindatastoragesystems-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{venkatesan_reliability_2011,\n type={4},\n author = {Venkatesan, Vinodh and Iliadis, Ilias and Fragouli, C. and Urbanke, R.},\n booktitle = {{IEEE} {International} {Symposium} on {Modeling}, {Analysis} and {Simulation} of {Computer} and {Telecommunication} {Systems} ({MASCOTS})},\n month = {August},\n tags = {storage},\n title = {Reliability of clustered vs. declustered replica placement in data storage systems},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2010\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2010')\"\n      onkeypress=\"toggleGroup('group_2010')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2010</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"dhulipala-fragouli-orlitsky-silencebasedcommunication-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   A. Dhulipala;  C. Fragouli;  and  A. Orlitsky.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Silence based communication.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 56.  2010.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dhulipala-fragouli-orlitsky-silencebasedcommunication-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dhulipala-fragouli-orlitsky-silencebasedcommunication-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{dhulipala_silence_2010,\n abstract = {Communication complexity—the minimum amount of communication required—of computing a function of data held by several parties is studied. A communication model where silence is used to convey information is introduced. For this model the worst-case and average-case complexities of symmetric functions are studied. For binary-input functions the average- and worst-case complexities are determined and the protocols achieving them are described. For functions of non-binary inputs one-round communication, where each party is restricted to communicate in consecutive stages, is considered and the extra amount of communication required by one- over multi-round communication is analyzed. For the special case of ternary-input functions close lower and upper bounds on the worst-case one-round complexity are provided and protocols achieving them are described. Protocols achieving the average-case one-round complexity for ternary-input functions are also described. These protocols can be generalized to inputs of arbitrary size.},\n type={2},\n author = {Dhulipala, A. and Fragouli, C. and Orlitsky, A.},\n journal = {IEEE Transactions on Information Theory},\n tags = {sensor_networks},\n title = {Silence based communication},\n volume = {56},\n year = {2010}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Communication complexity—the minimum amount of communication required—of computing a function of data held by several parties is studied. A communication model where silence is used to convey information is introduced. For this model the worst-case and average-case complexities of symmetric functions are studied. For binary-input functions the average- and worst-case complexities are determined and the protocols achieving them are described. For functions of non-binary inputs one-round communication, where each party is restricted to communicate in consecutive stages, is considered and the extra amount of communication required by one- over multi-round communication is analyzed. For the special case of ternary-input functions close lower and upper bounds on the worst-case one-round complexity are provided and protocols achieving them are described. Protocols achieving the average-case one-round complexity for ternary-input functions are also described. These protocols can be generalized to inputs of arbitrary size.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (13)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"karamchandani-keller-fragouli-franceschetti-functioncomputationviasubspacecoding-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Nikhil Karamchandani;  L. Keller;  C. Fragouli;  and  Massimo Franceschetti.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Function computation via subspace coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>,  2010. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/isit.2010.5513755\"\n     onclick=\"log_download('karamchandani-keller-fragouli-franceschetti-functioncomputationviasubspacecoding-2010', 'http://doi.org/10.1109/isit.2010.5513755', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/karamchandani-keller-fragouli-franceschetti-functioncomputationviasubspacecoding-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('karamchandani-keller-fragouli-franceschetti-functioncomputationviasubspacecoding-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{karamchandani_function_2010,\n abstract = {This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.},\n type={4},\n author = {Karamchandani, Nikhil and Keller, L. and Fragouli, C. and Franceschetti, Massimo},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n doi = {10.1109/isit.2010.5513755},\n tags = {wireless,network_coding},\n title = {Function computation via subspace coding},\n year = {2010}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"keller-karamchandani-fragouli-functioncomputationoverlinearchannels-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Keller;  Nikhil Karamchandani;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Function computation over linear channels.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Network Coding (NetCod)</i>,  2010. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/NETCOD.2010.5487679\"\n     onclick=\"log_download('keller-karamchandani-fragouli-functioncomputationoverlinearchannels-2010', 'http://doi.org/10.1109/NETCOD.2010.5487679', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/keller-karamchandani-fragouli-functioncomputationoverlinearchannels-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('keller-karamchandani-fragouli-functioncomputationoverlinearchannels-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{keller_function_2010,\n abstract = {This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.},\n type={4},\n author = {Keller, L. and Karamchandani, Nikhil and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} on {Network} {Coding} ({NetCod})},\n doi = {10.1109/NETCOD.2010.5487679},\n tags = {wireless,network_coding},\n title = {Function computation over linear channels},\n year = {2010}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"venkatesan-iliadis-hu-haas-fragouli-effectofreplicaplacementonthereliabilityoflargescaledatastoragesystems-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Vinodh Venkatesan;  Ilias Iliadis;  Xiao-Yu Hu;  Robert Haas;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Effect of Replica Placement on the Reliability of Large-Scale Data Storage Systems.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Modeling, Analysis, and Simulation of Computer Systems, International Symposium on</i>, 0: 79–88.  2010.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/venkatesan-iliadis-hu-haas-fragouli-effectofreplicaplacementonthereliabilityoflargescaledatastoragesystems-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('venkatesan-iliadis-hu-haas-fragouli-effectofreplicaplacementonthereliabilityoflargescaledatastoragesystems-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{venkatesan_effect_2010,\n type={4},\n author = {Venkatesan, Vinodh and Iliadis, Ilias and Hu, Xiao-Yu and Haas, Robert and Fragouli, C.},\n journal = {Modeling, Analysis, and Simulation of Computer Systems, International Symposium on},\n pages = {79--88},\n tags = {storage},\n title = {Effect of {Replica} {Placement} on the {Reliability} of {Large}-{Scale} {Data} {Storage} {Systems}},\n volume = {0},\n year = {2010}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"appuswamy-atsan-fragouli-franceschetti-onrelayplacementfordeterministiclinenetworks-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   R. Appuswamy;  Emre Atsan;  C. Fragouli;  and  Massimo Franceschetti.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On relay placement for deterministic line networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Wireless Network Coding Workshop (WiNC)</i>,  2010. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/appuswamy-atsan-fragouli-franceschetti-onrelayplacementfordeterministiclinenetworks-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('appuswamy-atsan-fragouli-franceschetti-onrelayplacementfordeterministiclinenetworks-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{appuswamy_relay_2010,\n abstract = {We consider a unicast communication problem where a source transmits information to a destination through a wireless network with the help of k relays positioned on a line. We adopt the linear deterministic model to capture the wireless signal interactions and study the optimal placement of the relays so that the capacity from the source to the destination in the deterministic network is maximized. Analytical results are provided for a number of special cases, and the insights gained are used to provide a heuristic framework for designing large relay networks.},\n type={4},\n author = {Appuswamy, R. and Atsan, Emre and Fragouli, C. and Franceschetti, Massimo},\n booktitle = {{IEEE} {Wireless} {Network} {Coding} {Workshop} ({WiNC})},\n tags = {wireless},\n title = {On relay placement for deterministic line networks},\n year = {2010}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider a unicast communication problem where a source transmits information to a destination through a wireless network with the help of k relays positioned on a line. We adopt the linear deterministic model to capture the wireless signal interactions and study the optimal placement of the relays so that the capacity from the source to the destination in the deterministic network is maximized. Analytical results are provided for a number of special cases, and the insights gained are used to provide a heuristic framework for designing large relay networks.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ebrahimi-fragouli-algebraictechniquesfordeterministicnetworks-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Javad Ebrahimi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Algebraic techniques for deterministic networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>International conference on Signal Processing and Communications (SPCOM)</i>,  2010. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ebrahimi-fragouli-algebraictechniquesfordeterministicnetworks-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ebrahimi-fragouli-algebraictechniquesfordeterministicnetworks-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{ebrahimi_algebraic_2010,\n type={4},\n author = {Ebrahimi, Javad and Fragouli, C.},\n booktitle = {International conference on {Signal} {Processing} and {Communications} ({SPCOM})},\n tags = {wireless},\n title = {Algebraic techniques for deterministic networks},\n year = {2010}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ebrahimi-fragouli-onthebenefitsofvectornetworkcoding-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Javad Ebrahimi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On the benefits of vector network coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>48th Annual Allerton Conference on Communication, Control, and Computing</i>,  2010. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ebrahimi-fragouli-onthebenefitsofvectornetworkcoding-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ebrahimi-fragouli-onthebenefitsofvectornetworkcoding-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{ebrahimi_benefits_2010,\n abstract = {In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L x L coding matrices that play a similar role as coding coefficients in scalar coding. Vector network coding generalizes scalar coding, and thus offers a wider range of solutions over which to optimize. This paper starts exploring the new possibilities vector network coding can offer along two directions. First, we propose a new randomized algorithm for vector network coding. We compare the performance of our proposed algorithm with the existing randomized algorithms in the literature over a specific class of networks. Second, we explore the use of structured coding matrices for vector network coding. We present deterministic designs that allow to operate using rotation coding matrices and thus result in reduced encoding complexity.},\n type={4},\n author = {Ebrahimi, Javad and Fragouli, C.},\n booktitle = {48th {Annual} {Allerton} {Conference} on {Communication}, {Control}, and {Computing}},\n tags = {network_coding},\n title = {On the benefits of vector network coding},\n year = {2010}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L x L coding matrices that play a similar role as coding coefficients in scalar coding. Vector network coding generalizes scalar coding, and thus offers a wider range of solutions over which to optimize. This paper starts exploring the new possibilities vector network coding can offer along two directions. First, we propose a new randomized algorithm for vector network coding. We compare the performance of our proposed algorithm with the existing randomized algorithms in the literature over a specific class of networks. Second, we explore the use of structured coding matrices for vector network coding. We present deterministic designs that allow to operate using rotation coding matrices and thus result in reduced encoding complexity.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ebrahimi-fragouli-multicastingalgorithmsfordeterministicnetworks-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Javad Ebrahimi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Multicasting algorithms for deterministic networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Information Theory Workshop (ITW)</i>, January 2010. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/itwksps.2010.5503221\"\n     onclick=\"log_download('ebrahimi-fragouli-multicastingalgorithmsfordeterministicnetworks-2010', 'http://doi.org/10.1109/itwksps.2010.5503221', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ebrahimi-fragouli-multicastingalgorithmsfordeterministicnetworks-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ebrahimi-fragouli-multicastingalgorithmsfordeterministicnetworks-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{ebrahimi_multicasting_2010,\n abstract = {We present a polynomial time algorithm for multicasting rate h to N receivers over deterministic networks. Our algorithm requires intermediate network nodes to perform coding operations over vectors of a finite length L, through multiplication with L \\#x00D7; L binary coding matrices that play the same role as coding coefficients over graphs. Our code design consists in selecting these matrices so that each receiver is able to recover the source information. As a special case, we provide an alternative construction for a unicast algorithm over deterministic networks.},\n type={4},\n author = {Ebrahimi, Javad and Fragouli, C.},\n booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},\n doi = {10.1109/itwksps.2010.5503221},\n month = {January},\n tags = {wireless},\n title = {Multicasting algorithms for deterministic networks},\n year = {2010}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We present a polynomial time algorithm for multicasting rate h to N receivers over deterministic networks. Our algorithm requires intermediate network nodes to perform coding operations over vectors of a finite length L, through multiplication with L #x00D7; L binary coding matrices that play the same role as coding coefficients over graphs. Our code design consists in selecting these matrices so that each receiver is able to recover the source information. As a special case, we provide an alternative construction for a unicast algorithm over deterministic networks.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ebrahimi-fragouli-vectornetworkcoding-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Javad Ebrahimi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Vector network coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>,  2010. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/isit.2010.5513771\"\n     onclick=\"log_download('ebrahimi-fragouli-vectornetworkcoding-2010', 'http://doi.org/10.1109/isit.2010.5513771', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ebrahimi-fragouli-vectornetworkcoding-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ebrahimi-fragouli-vectornetworkcoding-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{ebrahimi_vector_2010,\n abstract = {We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L x L coding matrices that play a similar role as coding coefficients in scalar coding. Our algorithms for scalar network jointly optimize the employed field size while selecting the coding coefficients. Similarly, for vector coding, our algorithms optimize the length L while designing the coding matrices. These algorithms apply both for regular network graphs as well as linear deterministic networks.},\n type={4},\n author = {Ebrahimi, Javad and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n doi = {10.1109/isit.2010.5513771},\n keywords = {algebraic algorithms, coding coefficients, coding matrices, intermediate node process, linear deterministic networks, matrix algebra, network coding, network graphs, network theory (graphs), scalar network coding, source multicast information, vector network coding algorithms},\n tags = {network_coding},\n title = {Vector network coding},\n year = {2010}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L x L coding matrices that play a similar role as coding coefficients in scalar coding. Our algorithms for scalar network jointly optimize the employed field size while selecting the coding coefficients. Similarly, for vector coding, our algorithms optimize the length L while designing the coding matrices. These algorithms apply both for regular network graphs as well as linear deterministic networks.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"karamchandani-keller-fragouli-franceschetti-functioncomputationviasubspacecoding-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Nikhil Karamchandani;  L. Keller;  C. Fragouli;  and  Massimo Franceschetti.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Function computation via subspace coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>,  2010. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/isit.2010.5513755\"\n     onclick=\"log_download('karamchandani-keller-fragouli-franceschetti-functioncomputationviasubspacecoding-2010', 'http://doi.org/10.1109/isit.2010.5513755', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/karamchandani-keller-fragouli-franceschetti-functioncomputationviasubspacecoding-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('karamchandani-keller-fragouli-franceschetti-functioncomputationviasubspacecoding-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{karamchandani_function_2010,\n abstract = {This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.},\n type={4},\n author = {Karamchandani, Nikhil and Keller, L. and Fragouli, C. and Franceschetti, Massimo},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n doi = {10.1109/isit.2010.5513755},\n tags = {wireless,network_coding},\n title = {Function computation via subspace coding},\n year = {2010}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"keller-karamchandani-fragouli-functioncomputationoverlinearchannels-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Keller;  Nikhil Karamchandani;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Function computation over linear channels.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Network Coding (NetCod)</i>,  2010. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/NETCOD.2010.5487679\"\n     onclick=\"log_download('keller-karamchandani-fragouli-functioncomputationoverlinearchannels-2010', 'http://doi.org/10.1109/NETCOD.2010.5487679', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/keller-karamchandani-fragouli-functioncomputationoverlinearchannels-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('keller-karamchandani-fragouli-functioncomputationoverlinearchannels-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{keller_function_2010,\n abstract = {This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.},\n type={4},\n author = {Keller, L. and Karamchandani, Nikhil and Fragouli, C.},\n booktitle = {{IEEE} {International} {Symposium} on {Network} {Coding} ({NetCod})},\n doi = {10.1109/NETCOD.2010.5487679},\n tags = {wireless,network_coding},\n title = {Function computation over linear channels},\n year = {2010}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"keller-jafarisiavoshani-argyraki-fragouli-diggavi-jointidentitymessagecodingforsensornetworks-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Keller;  Mahdi Jafari Siavoshani;  K. Argyraki;  C. Fragouli;  and  Suhas N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Joint identity-message coding for sensor networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE JSAC on Wireless Sensor Networks</i>.  2010.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/JSAC.2010.100913\"\n     onclick=\"log_download('keller-jafarisiavoshani-argyraki-fragouli-diggavi-jointidentitymessagecodingforsensornetworks-2010', 'http://doi.org/10.1109/JSAC.2010.100913', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/keller-jafarisiavoshani-argyraki-fragouli-diggavi-jointidentitymessagecodingforsensornetworks-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('keller-jafarisiavoshani-argyraki-fragouli-diggavi-jointidentitymessagecodingforsensornetworks-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{keller_joint_2010,\n abstract = {In a significant class of sensor-network applications, the identities of the reporting sensors constitute the bulk of the communicated data, whereas the message itself can be as small as a single bit—for instance, in many cases, sensors are used to detect whether and where a certain interesting condition occurred, or to track incremental environmental changes at fixed locations. In such scenarios, the traditional network-protocol paradigm of separately specifying the source identity and the message in distinct fields leads to inefficient communication. This work addresses the question of how communication should happen in such identity-aware sensor networks. We calculate theoretical performance bounds for this type of communication, where “performance” refers to the number of transmitted bits. We propose a communication protocol, where the identity and message of each source are specified jointly using subspace coding. We show through analysis and simulation that our protocol&#x27;s performance is close to optimal and compare it to the performance of a traditional protocol, where identity and message are specified separately.},\n type={4},\n author = {Keller, L. and Jafari Siavoshani, Mahdi and Argyraki, K. and Fragouli, C. and Diggavi, Suhas N.},\n doi = {10.1109/JSAC.2010.100913},\n journal = {IEEE JSAC on Wireless Sensor Networks},\n tags = {sensor_networks},\n title = {Joint identity-message coding for sensor networks},\n year = {2010}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In a significant class of sensor-network applications, the identities of the reporting sensors constitute the bulk of the communicated data, whereas the message itself can be as small as a single bit—for instance, in many cases, sensors are used to detect whether and where a certain interesting condition occurred, or to track incremental environmental changes at fixed locations. In such scenarios, the traditional network-protocol paradigm of separately specifying the source identity and the message in distinct fields leads to inefficient communication. This work addresses the question of how communication should happen in such identity-aware sensor networks. We calculate theoretical performance bounds for this type of communication, where “performance” refers to the number of transmitted bits. We propose a communication protocol, where the identity and message of each source are specified jointly using subspace coding. We show through analysis and simulation that our protocol's performance is close to optimal and compare it to the performance of a traditional protocol, where identity and message are specified separately.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sattari-markopoulou-fragouli-inferringlogicaltopologiesusingnetworkcoding-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   P. Sattari;  Athina Markopoulou;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Inferring Logical Topologies using Network Coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>N/A</i>.  2010.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sattari-markopoulou-fragouli-inferringlogicaltopologiesusingnetworkcoding-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sattari-markopoulou-fragouli-inferringlogicaltopologiesusingnetworkcoding-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{sattari_inferring_2010,\n abstract = {The network coding paradigm is based on the idea that independent information flows can be linearly combined throughout the network to give benefits in terms of throughput, complexity, etc. In this paper, we explore the application of the network coding paradigm to topology inference. Our goal is to infer the topology of a network by sending probes between a given set of multiple sources and multiple receivers and by having intermediate nodes perform network coding operations. Our main idea behind using network coding is to introduce topologydependent correlation, which can be exploited at the receivers to infer the topology. We explored this idea in [33] for trees. We also combined network coding and tomographic techniques to infer the topology of a Directed Acyclic Graph (DAG), under specific routing assumptions, in [34]. The supporting idea in [34] was to decompose a traditional (i.e., without network coding) multiple source, multiple receiver tomography problem into multiple two source, two receiver subproblems, as shown in [12]. In this paper, we unify and extend our two previous pieces of work. Our main contribution is that when intermediate nodes perform network coding, topological information contained in network coded packets allows to uniquely identify a tree topology, or to accurately distinguish among all different 2-by-2 subnetwork components in a general DAG; this knowledge can then be used to merge the subnetworks and reconstruct the general topology. Our approach is applicable to any general Internet-like topology, and is robust to the presence of delay variability and packet loss.},\n type={4},\n author = {Sattari, P. and Markopoulou, Athina and Fragouli, C.},\n journal = {N/A},\n tags = {network_coding},\n title = {Inferring {Logical} {Topologies} using {Network} {Coding}},\n year = {2010}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The network coding paradigm is based on the idea that independent information flows can be linearly combined throughout the network to give benefits in terms of throughput, complexity, etc. In this paper, we explore the application of the network coding paradigm to topology inference. Our goal is to infer the topology of a network by sending probes between a given set of multiple sources and multiple receivers and by having intermediate nodes perform network coding operations. Our main idea behind using network coding is to introduce topologydependent correlation, which can be exploited at the receivers to infer the topology. We explored this idea in [33] for trees. We also combined network coding and tomographic techniques to infer the topology of a Directed Acyclic Graph (DAG), under specific routing assumptions, in [34]. The supporting idea in [34] was to decompose a traditional (i.e., without network coding) multiple source, multiple receiver tomography problem into multiple two source, two receiver subproblems, as shown in [12]. In this paper, we unify and extend our two previous pieces of work. Our main contribution is that when intermediate nodes perform network coding, topological information contained in network coded packets allows to uniquely identify a tree topology, or to accurately distinguish among all different 2-by-2 subnetwork components in a general DAG; this knowledge can then be used to merge the subnetworks and reconstruct the general topology. Our approach is applicable to any general Internet-like topology, and is robust to the presence of delay variability and packet loss.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"venkatesan-iliadis-hu-haas-fragouli-effectofreplicaplacementonthereliabilityoflargescaledatastoragesystems-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Vinodh Venkatesan;  Ilias Iliadis;  Xiao-Yu Hu;  Robert Haas;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Effect of Replica Placement on the Reliability of Large-Scale Data Storage Systems.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Modeling, Analysis, and Simulation of Computer Systems, International Symposium on</i>, 0: 79–88.  2010.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/venkatesan-iliadis-hu-haas-fragouli-effectofreplicaplacementonthereliabilityoflargescaledatastoragesystems-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('venkatesan-iliadis-hu-haas-fragouli-effectofreplicaplacementonthereliabilityoflargescaledatastoragesystems-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{venkatesan_effect_2010,\n abstract = {Replication is a widely used method to protect largescale data storage systems from data loss when storage nodes fail. It is well known that the placement of replicas of the different data blocks across the nodes affects the time to rebuild. Several systems described in the literature are designed based on the premise that minimizing the rebuild times maximizes the system reliability. Our results however indicate that the reliability is essentially unaffected by the replica placement scheme. We show that, for a replication factor of two, all possible placement schemes have mean times to data loss (MTTDLs) within a factor of two for practical values of the failure rate, storage capacity, and rebuild bandwidth of a storage node. The theoretical results are confirmed by means of event-driven simulation. For higher replication factors, an analytical derivation of MTTDL becomes intractable for a general placement scheme. We therefore use one of the alternate measures of reliability that have been proposed in the literature, namely, the probability of data loss during rebuild in the critical mode of the system. Whereas for a replication factor of two this measure can be directly translated into MTTDL, it is only speculative of the MTTDL behavior for higher replication factors. This measure of reliability is shown to lie within a factor of two for all possible placement schemes and any replication factor. We also show that for any replication factor, the clustered placement scheme has the lowest probability of data loss during rebuild in critical mode among all possible placement schemes, whereas the declustered placement scheme has the highest probability. Simulation results reveal however that these properties do not hold for the corresponding MTTDLs for a replication factor greater than two. This indicates that some alternate measures of reliability may not be appropriate for comparing the MTTDL of different placement schemes.},\n type={4},\n author = {Venkatesan, Vinodh and Iliadis, Ilias and Hu, Xiao-Yu and Haas, Robert and Fragouli, C.},\n journal = {Modeling, Analysis, and Simulation of Computer Systems, International Symposium on},\n pages = {79--88},\n tags = {storage},\n title = {Effect of {Replica} {Placement} on the {Reliability} of {Large}-{Scale} {Data} {Storage} {Systems}},\n volume = {0},\n year = {2010}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Replication is a widely used method to protect largescale data storage systems from data loss when storage nodes fail. It is well known that the placement of replicas of the different data blocks across the nodes affects the time to rebuild. Several systems described in the literature are designed based on the premise that minimizing the rebuild times maximizes the system reliability. Our results however indicate that the reliability is essentially unaffected by the replica placement scheme. We show that, for a replication factor of two, all possible placement schemes have mean times to data loss (MTTDLs) within a factor of two for practical values of the failure rate, storage capacity, and rebuild bandwidth of a storage node. The theoretical results are confirmed by means of event-driven simulation. For higher replication factors, an analytical derivation of MTTDL becomes intractable for a general placement scheme. We therefore use one of the alternate measures of reliability that have been proposed in the literature, namely, the probability of data loss during rebuild in the critical mode of the system. Whereas for a replication factor of two this measure can be directly translated into MTTDL, it is only speculative of the MTTDL behavior for higher replication factors. This measure of reliability is shown to lie within a factor of two for all possible placement schemes and any replication factor. We also show that for any replication factor, the clustered placement scheme has the lowest probability of data loss during rebuild in critical mode among all possible placement schemes, whereas the declustered placement scheme has the highest probability. Simulation results reveal however that these properties do not hold for the corresponding MTTDLs for a replication factor greater than two. This indicates that some alternate measures of reliability may not be appropriate for comparing the MTTDL of different placement schemes.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2009\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2009')\"\n      onkeypress=\"toggleGroup('group_2009')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2009</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"fragouli-markopoulou-gjoka-anetworkcodingapproachtonetworktomography-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  Athina Markopoulou;  and  M. Gjoka.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A network coding approach to network tomography.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>. January 2009.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-markopoulou-gjoka-anetworkcodingapproachtonetworktomography-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-markopoulou-gjoka-anetworkcodingapproachtonetworktomography-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_network_2009,\n type={2},\n author = {Fragouli, C. and Markopoulou, Athina and Gjoka, M.},\n journal = {IEEE Transactions on Information Theory},\n month = {January},\n tags = {wireless},\n title = {A network coding approach to network tomography},\n year = {2009}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"mohajer-diggavi-fragouli-tse-approximatecapacityofaclassofgaussianinterferencerelaynetworks-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Mohajer;  Suhas N. Diggavi;  C. Fragouli;  and  D. Tse.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Approximate capacity of a class of gaussian interference-relay networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>.  2009.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mohajer-diggavi-fragouli-tse-approximatecapacityofaclassofgaussianinterferencerelaynetworks-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mohajer-diggavi-fragouli-tse-approximatecapacityofaclassofgaussianinterferencerelaynetworks-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{mohajer_approximate_2009,\n type={2},\n author = {Mohajer, S. and Diggavi, Suhas N. and Fragouli, C. and Tse, D.},\n journal = {IEEE Transactions on Information Theory},\n tags = {network_coding},\n title = {Approximate capacity of a class of gaussian interference-relay networks},\n year = {2009}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (14)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"amaudruz-fragouli-combinatorialalgorithmsforwirelessinformationflow-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   A. Amaudruz;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Combinatorial algorithms for wireless information flow.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>ACM-SIAM Symposium on Discrete Algorithms (SODA)</i>.  2009.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/amaudruz-fragouli-combinatorialalgorithmsforwirelessinformationflow-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('amaudruz-fragouli-combinatorialalgorithmsforwirelessinformationflow-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{amaudruz_combinatorial_2009,\n abstract = {A long-standing open question in information theory is to characterize the unicast capacity of a wireless relay network. The difficulty arises due to the complex signal interactions induced in the network, since the wireless channel inherently broadcasts the signals and there is interference among transmissions. Recently, Avestimehr, Diggavi and Tse proposed a linear binary deterministic model that takes into account the shared nature of wireless channels, focusing on the signal interactions rather than the background noise. They generalized the min-cut max-flow theorem for graphs to networks of deterministic channels and proved that the capacity can be achieved using information theoretical tools. They showed that the value of the minimum cut is in this case the minimum rank of all the binary adjacency matrices describing source-destination cuts. However, since there exists an exponential number of cuts, identifying the capacity through exhaustive search becomes infeasible. In this work, we develop a polynomial time algorithm that discovers the relay encoding strategy to achieve the min-cut value in binary linear deterministic (wireless) networks, for the case of a unicast connection. Our algorithm crucially uses a notion of linear independence between edges to calculate the capacity in polynomial time. Moreover, we can achieve the capacity by using very simple one-bit processing at the intermediate nodes, thereby constructively yielding finite length strategies that achieve the unicast capacity of the linear deterministic (wireless) relay network.},\n type={4},\n author = {Amaudruz, A. and Fragouli, C.},\n journal = {ACM-SIAM Symposium on Discrete Algorithms (SODA)},\n tags = {wireless},\n title = {Combinatorial algorithms for wireless information flow},\n year = {2009}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  A long-standing open question in information theory is to characterize the unicast capacity of a wireless relay network. The difficulty arises due to the complex signal interactions induced in the network, since the wireless channel inherently broadcasts the signals and there is interference among transmissions. Recently, Avestimehr, Diggavi and Tse proposed a linear binary deterministic model that takes into account the shared nature of wireless channels, focusing on the signal interactions rather than the background noise. They generalized the min-cut max-flow theorem for graphs to networks of deterministic channels and proved that the capacity can be achieved using information theoretical tools. They showed that the value of the minimum cut is in this case the minimum rank of all the binary adjacency matrices describing source-destination cuts. However, since there exists an exponential number of cuts, identifying the capacity through exhaustive search becomes infeasible. In this work, we develop a polynomial time algorithm that discovers the relay encoding strategy to achieve the min-cut value in binary linear deterministic (wireless) networks, for the case of a unicast connection. Our algorithm crucially uses a notion of linear independence between edges to calculate the capacity in polynomial time. Moreover, we can achieve the capacity by using very simple one-bit processing at the intermediate nodes, thereby constructively yielding finite length strategies that achieve the unicast capacity of the linear deterministic (wireless) relay network.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"drinea-fragouli-keller-delaywithnetworkcodingandfeedback-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Eleni Drinea;  C. Fragouli;  and  L. Keller.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Delay with network coding and feedback.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>,  2009. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/isit.2009.5205612\"\n     onclick=\"log_download('drinea-fragouli-keller-delaywithnetworkcodingandfeedback-2009', 'http://doi.org/10.1109/isit.2009.5205612', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/drinea-fragouli-keller-delaywithnetworkcodingandfeedback-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('drinea-fragouli-keller-delaywithnetworkcodingandfeedback-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{drinea_delay_2009,\n type={4},\n author = {Drinea, Eleni and Fragouli, C. and Keller, L.},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n doi = {10.1109/isit.2009.5205612},\n keywords = {network coding, channel coding, erasure channel, feedback, feedback information, multiple description coding, NP-hard, offline algorithm, offline minimization problem, online algorithm, online heuristics},\n tags = {network_coding,wireless},\n title = {Delay with network coding and feedback},\n year = {2009}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-argyraki-keller-multipathdiversityandrobustnessforsensornetworks-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  K. Argyraki;  and  L. Keller.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Multipath Diversity and Robustness for Sensor Networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Sensor Networks</i>, pages 75–99. Springer,  2009.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-argyraki-keller-multipathdiversityandrobustnessforsensornetworks-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-argyraki-keller-multipathdiversityandrobustnessforsensornetworks-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@incollection{fragouli_multipath_2009,\n abstract = {Balancing energy efficiency and reliability is a common underlying goal for most information collection protocols in sensor networks. Multipath diversity has emerged as one of the promising techniques to achieve such a balance. In this chapter, we provide a unified framework for the multipath techniques in the literature and discuss their basic benefits and drawbacks. We also discuss emerging techniques from the area of network coding.},\n type={4},\n author = {Fragouli, C. and Argyraki, K. and Keller, L.},\n booktitle = {Sensor {Networks}},\n pages = {75--99},\n publisher = {Springer},\n tags = {sensor_networks},\n title = {Multipath {Diversity} and {Robustness} for {Sensor} {Networks}},\n year = {2009}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Balancing energy efficiency and reliability is a common underlying goal for most information collection protocols in sensor networks. Multipath diversity has emerged as one of the promising techniques to achieve such a balance. In this chapter, we provide a unified framework for the multipath techniques in the literature and discuss their basic benefits and drawbacks. We also discuss emerging techniques from the area of network coding.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-anoverviewofnetworkcodingfordynamicallychangingnetworks-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  An overview of network coding for dynamically changing networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Int. J. Auton. Adapt. Commun. Syst.</i>, 2(1): 1–23.  2009.\n  <span class=\"note\">Place: Inderscience Publishers, Geneva, SWITZERLAND Publisher: Inderscience Publishers</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1504/ijaacs.2009.024280\"\n     onclick=\"log_download('fragouli-anoverviewofnetworkcodingfordynamicallychangingnetworks-2009', 'http://doi.org/10.1504/ijaacs.2009.024280', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-anoverviewofnetworkcodingfordynamicallychangingnetworks-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-anoverviewofnetworkcodingfordynamicallychangingnetworks-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_overview_2009,\n type={4},\n author = {Fragouli, C.},\n doi = {10.1504/ijaacs.2009.024280},\n issn = {1754-8632},\n journal = {Int. J. Auton. Adapt. Commun. Syst.},\n note = {Place: Inderscience Publishers, Geneva, SWITZERLAND\nPublisher: Inderscience Publishers},\n number = {1},\n pages = {1--23},\n tags = {network_coding,wireless},\n title = {An overview of network coding for dynamically changing networks},\n volume = {2},\n year = {2009}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"goseling-fragouli-diggavi-networkcodingforundirectedinformationexchange-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   J. Goseling;  C. Fragouli;  and  Suhas N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Network coding for undirected information exchange.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Communications Letters, IEEE</i>, 13(1): 25–27. January 2009.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/lcomm.2009.081288\"\n     onclick=\"log_download('goseling-fragouli-diggavi-networkcodingforundirectedinformationexchange-2009', 'http://doi.org/10.1109/lcomm.2009.081288', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/goseling-fragouli-diggavi-networkcodingforundirectedinformationexchange-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('goseling-fragouli-diggavi-networkcodingforundirectedinformationexchange-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{goseling_network_2009,\n abstract = {We consider the information exchange problem where each in a set of terminals transmits information to all other terminals in the set, over an undirected network. We show that the design of only a single network code for multicasting is sufficient to achieve an arbitrary point in the achievable rate region. We also provide an alternative proof for the set of achievable rate tuples.},\n type={4},\n author = {Goseling, J. and Fragouli, C. and Diggavi, Suhas N.},\n doi = {10.1109/lcomm.2009.081288},\n journal = {Communications Letters, IEEE},\n keywords = {network coding, encodingmulticasting network code, undirected information exchange},\n month = {January},\n number = {1},\n pages = {25--27},\n tags = {network_coding},\n title = {Network coding for undirected information exchange},\n volume = {13},\n year = {2009}\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider the information exchange problem where each in a set of terminals transmits information to all other terminals in the set, over an undirected network. We show that the design of only a single network code for multicasting is sufficient to achieve an arbitrary point in the achievable rate region. We also provide an alternative proof for the set of achievable rate tuples.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"jafarisiavoshani-mohajer-fragouli-diggavi-onthecapacityofnoncoherentnetworkcoding-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Mahdi Jafari Siavoshani;  S. Mohajer;  C. Fragouli;  and  Suhas N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On the capacity of non-coherent network coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Information Theory, 2009. ISIT 2009. IEEE International Symposium on</i>, pages 273–277, July 2009. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/isit.2009.5205851\"\n     onclick=\"log_download('jafarisiavoshani-mohajer-fragouli-diggavi-onthecapacityofnoncoherentnetworkcoding-2009', 'http://doi.org/10.1109/isit.2009.5205851', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/jafarisiavoshani-mohajer-fragouli-diggavi-onthecapacityofnoncoherentnetworkcoding-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('jafarisiavoshani-mohajer-fragouli-diggavi-onthecapacityofnoncoherentnetworkcoding-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{jafari_siavoshani_capacity_2009,\n abstract = {The min-cut value towards a single receiver in a network with unit capacity edges can be achieved by routing a single bit. The multicast theorem in network coding shows that, the common min-cut value towards N ges 1 receivers can also be achieved using packets of length logN bits, if the operations the intermediate nodes perform are deterministically known at the receivers. We here calculate the capacity in the case where these operations are unknown, and characterize how the capacity depends on the min-cut value and the packet length.},\n type={4},\n author = {Jafari Siavoshani, Mahdi and Mohajer, S. and Fragouli, C. and Diggavi, Suhas N.},\n booktitle = {Information {Theory}, 2009. {ISIT} 2009. {IEEE} {International} {Symposium} on},\n doi = {10.1109/isit.2009.5205851},\n keywords = {multicast theorem, noncoherent network coding, packet length, single bit routing, source coding, telecommunication network routingmin-cut value towards},\n month = {July},\n pages = {273--277},\n tags = {network_coding,wireless},\n title = {On the capacity of non-coherent network coding},\n year = {2009}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The min-cut value towards a single receiver in a network with unit capacity edges can be achieved by routing a single bit. The multicast theorem in network coding shows that, the common min-cut value towards N ges 1 receivers can also be achieved using packets of length logN bits, if the operations the intermediate nodes perform are deterministically known at the receivers. We here calculate the capacity in the case where these operations are unknown, and characterize how the capacity depends on the min-cut value and the packet length.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"jafarisiavoshani-keller-argyraki-fragouli-compressednetworkcodingvectors-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Mahdi Jafari Siavoshani;  L. Keller;  K. Argyraki;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Compressed network coding vectors.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Information Theory, 2009. ISIT 2009. IEEE International Symposium on</i>, pages 109–113, July 2009. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/isit.2009.5206041\"\n     onclick=\"log_download('jafarisiavoshani-keller-argyraki-fragouli-compressednetworkcodingvectors-2009', 'http://doi.org/10.1109/isit.2009.5206041', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/jafarisiavoshani-keller-argyraki-fragouli-compressednetworkcodingvectors-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('jafarisiavoshani-keller-argyraki-fragouli-compressednetworkcodingvectors-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{jafari_siavoshani_compressed_2009,\n abstract = {In networks that employ network coding, two main approaches have been proposed in the literature to allow the receivers to recover the source information: (i) use of coding vectors, that keep track of the linear combinations the received packets contain, and (ii) subspace coding, that dispenses of the need to know the linear combinations, since information is conveyed from the choice of subspaces alone. Both these approaches impose the strong requirement that all source packets get potentially combined. We here present a third approach that relaxes this assumption, and is thus not a special case from either of the previous two. This relaxation allows to employ compressed coding vectors to efficiently convey the coding coefficients, without altering the operation of intermediate network nodes. We develop optimal designs for such vectors.},\n type={4},\n author = {Jafari Siavoshani, Mahdi and Keller, L. and Argyraki, K. and Fragouli, C.},\n booktitle = {Information {Theory}, 2009. {ISIT} 2009. {IEEE} {International} {Symposium} on},\n doi = {10.1109/isit.2009.5206041},\n keywords = {linear codes, data compression, intermediate network node, linear combination, subspace coding, vectorscompressed network coding vector},\n month = {July},\n pages = {109--113},\n tags = {network_coding,sensor_networks},\n title = {Compressed network coding vectors},\n year = {2009}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In networks that employ network coding, two main approaches have been proposed in the literature to allow the receivers to recover the source information: (i) use of coding vectors, that keep track of the linear combinations the received packets contain, and (ii) subspace coding, that dispenses of the need to know the linear combinations, since information is conveyed from the choice of subspaces alone. Both these approaches impose the strong requirement that all source packets get potentially combined. We here present a third approach that relaxes this assumption, and is thus not a special case from either of the previous two. This relaxation allows to employ compressed coding vectors to efficiently convey the coding coefficients, without altering the operation of intermediate network nodes. We develop optimal designs for such vectors.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"jafarian-lee-vishwanath-fragouli-distributedrateallocationfornetworkcodedsystems-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   A. Jafarian;  Sang Hyun Lee;  S. Vishwanath;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Distributed Rate Allocation for Network-coded Systems.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Sensor, Mesh and Ad Hoc Communications and Networks Workshops, 2009. SECON Workshops '09. 6th Annual IEEE Communications Society Conference on</i>, pages 1–6, June 2009. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/sahcnw.2009.5172929\"\n     onclick=\"log_download('jafarian-lee-vishwanath-fragouli-distributedrateallocationfornetworkcodedsystems-2009', 'http://doi.org/10.1109/sahcnw.2009.5172929', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/jafarian-lee-vishwanath-fragouli-distributedrateallocationfornetworkcodedsystems-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('jafarian-lee-vishwanath-fragouli-distributedrateallocationfornetworkcodedsystems-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{jafarian_distributed_2009,\n abstract = {This paper addresses the problem of distributed rate allocation for a class of multicast networks employing linear network coding. The goal is to minimize the cost (for example, the sum rates allocated to each link in the network) while satisfying a multicast rate requirement for each destination in the network. In essence, this paper aims to achieve network capacity while ensuring that the cost of operation (equivalently, the rate allocated per link in the network) is minimal. This paper uses a belief propagation framework to obtain a distributed algorithm for the rate allocation problem. Simulation results are presented to demonstrate the convergence of this algorithm to the optimal rate allocation solution.},\n type={4},\n author = {Jafarian, A. and Lee, Sang Hyun and Vishwanath, S. and Fragouli, C.},\n booktitle = {Sensor, {Mesh} and {Ad} {Hoc} {Communications} and {Networks} {Workshops}, 2009. {SECON} {Workshops} &#x27;09. 6th {Annual} {IEEE} {Communications} {Society} {Conference} on},\n doi = {10.1109/sahcnw.2009.5172929},\n keywords = {cost minimization, distributed algorithm, distributed algorithms, distributed rate allocation, linear codes, linear network coding, minimisationbelief propagation framework, multicast network, network capacity, network-coded system},\n month = {June},\n pages = {1--6},\n tags = {wireless},\n title = {Distributed {Rate} {Allocation} for {Network}-coded {Systems}},\n year = {2009}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper addresses the problem of distributed rate allocation for a class of multicast networks employing linear network coding. The goal is to minimize the cost (for example, the sum rates allocated to each link in the network) while satisfying a multicast rate requirement for each destination in the network. In essence, this paper aims to achieve network capacity while ensuring that the cost of operation (equivalently, the rate allocated per link in the network) is minimal. This paper uses a belief propagation framework to obtain a distributed algorithm for the rate allocation problem. Simulation results are presented to demonstrate the convergence of this algorithm to the optimal rate allocation solution.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"keller-jafarisiavoshani-fragouli-argyraki-diggavi-identityawaresensornetworks-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Keller;  Mahdi Jafari Siavoshani;  C. Fragouli;  K. Argyraki;  and  Suhas N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Identity aware sensor networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>INFOCOM 2009, IEEE</i>, pages 2177–2185, April 2009. \n  <span class=\"note\">ISSN: 0743-166X</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/infcom.2009.5062142\"\n     onclick=\"log_download('keller-jafarisiavoshani-fragouli-argyraki-diggavi-identityawaresensornetworks-2009', 'http://doi.org/10.1109/infcom.2009.5062142', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/keller-jafarisiavoshani-fragouli-argyraki-diggavi-identityawaresensornetworks-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('keller-jafarisiavoshani-fragouli-argyraki-diggavi-identityawaresensornetworks-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{keller_identity_2009,\n abstract = {In a significant class of sensor-network applications, the identities of the reporting sensors constitute the bulk of the communicated data, whereas the message itself can be as small as a single bit - for instance, in many cases, sensors are used to detect whether and where a certain interesting condition occured, or to track incremental environmental changes at fixed locations. In such scenarios, the traditional network-protocol paradigm of separately specifying the source identity and the message in distinct fields leads to inefficient communication. This work addresses the question of how should communication happen in such identity-aware sensor networks. We reexamine the traditional source-identity/message separation and propose a scheme for jointly encoding the two. We use this to develop a communication method for identity-aware sensor networks and show it to be energy efficient, simple to implement, and gracefully adaptable to scenarios frequently encountered in sensor networks - for instance, node failures, or large numbers of nodes where only few are active during each reporting round.},\n type={4},\n author = {Keller, L. and Jafari Siavoshani, Mahdi and Fragouli, C. and Argyraki, K. and Diggavi, Suhas N.},\n booktitle = {{INFOCOM} 2009, {IEEE}},\n doi = {10.1109/infcom.2009.5062142},\n keywords = {identity aware sensor networks, source-identity-message separation, wireless sensor networks, wireless sensor networksenergy efficient},\n month = {April},\n note = {ISSN: 0743-166X},\n pages = {2177--2185},\n tags = {sensor_networks},\n title = {Identity aware sensor networks},\n year = {2009}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In a significant class of sensor-network applications, the identities of the reporting sensors constitute the bulk of the communicated data, whereas the message itself can be as small as a single bit - for instance, in many cases, sensors are used to detect whether and where a certain interesting condition occured, or to track incremental environmental changes at fixed locations. In such scenarios, the traditional network-protocol paradigm of separately specifying the source identity and the message in distinct fields leads to inefficient communication. This work addresses the question of how should communication happen in such identity-aware sensor networks. We reexamine the traditional source-identity/message separation and propose a scheme for jointly encoding the two. We use this to develop a communication method for identity-aware sensor networks and show it to be energy efficient, simple to implement, and gracefully adaptable to scenarios frequently encountered in sensor networks - for instance, node failures, or large numbers of nodes where only few are active during each reporting round.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"keller-atsan-argyraki-fragouli-sensecodenetworkcodingforreliablesensornetworks-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Keller;  Emre Atsan;  K. Argyraki;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  SenseCode: Network coding for reliable sensor networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>EPFL Technical Report, in submission</i>.  2009.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/keller-atsan-argyraki-fragouli-sensecodenetworkcodingforreliablesensornetworks-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('keller-atsan-argyraki-fragouli-sensecodenetworkcodingforreliablesensornetworks-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{keller_sensecode_2009,\n abstract = {Designing a communication protocol for sensor networks often involves obtaining the “right” trade-off between energy efficiency and reliability. In this paper, we show that network coding provides a means to elegantly balance these two goals. We present the design and implementation of SenseCode, a collection protocol for sensor networks—and, to the best of our knowledge, the first such protocol to employ network coding. SenseCode provides a way to gracefully introduce a configurable amount of redundant information in the network, thereby increasing reliability in the face of packet loss. We compare SenseCode to the best (to our knowledge) existing alternative and show that it achieves higher reliability (typically 20\\%, in certain cases up to 30\\%), while consuming the same amount of network resources. We have implemented SenseCode as a TinyOs module, and evaluate it through TOSSIM simulations, as well as a testbed of 30 TinyNode sensors deployed in our department building},\n type={4},\n author = {Keller, L. and Atsan, Emre and Argyraki, K. and Fragouli, C.},\n journal = {EPFL Technical Report, in submission},\n tags = {network_coding,sensor_networks},\n title = {{SenseCode}: {Network} coding for reliable sensor networks},\n year = {2009}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Designing a communication protocol for sensor networks often involves obtaining the “right” trade-off between energy efficiency and reliability. In this paper, we show that network coding provides a means to elegantly balance these two goals. We present the design and implementation of SenseCode, a collection protocol for sensor networks—and, to the best of our knowledge, the first such protocol to employ network coding. SenseCode provides a way to gracefully introduce a configurable amount of redundant information in the network, thereby increasing reliability in the face of packet loss. We compare SenseCode to the best (to our knowledge) existing alternative and show that it achieves higher reliability (typically 20%, in certain cases up to 30%), while consuming the same amount of network resources. We have implemented SenseCode as a TinyOs module, and evaluate it through TOSSIM simulations, as well as a testbed of 30 TinyNode sensors deployed in our department building\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"mohajer-diggavi-fragouli-tse-capacityofdeterministiczchainrelayinterferencenetwork-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Mohajer;  Suhas N. Diggavi;  C. Fragouli;  and  D. Tse.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Capacity of deterministic Z-chain relay-interference network.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Information Theory Workshop (ITW)</i>,  2009. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mohajer-diggavi-fragouli-tse-capacityofdeterministiczchainrelayinterferencenetwork-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mohajer-diggavi-fragouli-tse-capacityofdeterministiczchainrelayinterferencenetwork-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{mohajer_capacity_2009,\n abstract = {The wireless multiple-unicast problem is considered over a layered network, where the rates of transmission are limited by the relaying and interference effect. The deterministic model introduced is used to capture the broadcasting and multiple access effects. The capacity region of the Z-chain relay-interference network is fully characterized. In order to solve the problem, we introduce a new achievability scheme based on ldquointerference neutralizationrdquo and a new analysis technique to bound the number of non-interfering (pure) signals},\n type={4},\n author = {Mohajer, S. and Diggavi, Suhas N. and Fragouli, C. and Tse, D.},\n booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},\n tags = {network_coding,wireless},\n title = {Capacity of deterministic {Z}-chain relay-interference network},\n year = {2009}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The wireless multiple-unicast problem is considered over a layered network, where the rates of transmission are limited by the relaying and interference effect. The deterministic model introduced is used to capture the broadcasting and multiple access effects. The capacity region of the Z-chain relay-interference network is fully characterized. In order to solve the problem, we introduce a new achievability scheme based on ldquointerference neutralizationrdquo and a new analysis technique to bound the number of non-interfering (pure) signals\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"mohajer-jafarisiavoshani-diggavi-fragouli-onthecapacityofmultisourcenoncoherentnetworkcoding-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Mohajer;  Mahdi Jafari Siavoshani;  Suhas N. Diggavi;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On the capacity of multisource non-coherent network coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Networking and Information Theory, 2009. ITW 2009. IEEE Information Theory Workshop on</i>, pages 130–134, June 2009. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/itwnit.2009.5158556\"\n     onclick=\"log_download('mohajer-jafarisiavoshani-diggavi-fragouli-onthecapacityofmultisourcenoncoherentnetworkcoding-2009', 'http://doi.org/10.1109/itwnit.2009.5158556', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mohajer-jafarisiavoshani-diggavi-fragouli-onthecapacityofmultisourcenoncoherentnetworkcoding-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mohajer-jafarisiavoshani-diggavi-fragouli-onthecapacityofmultisourcenoncoherentnetworkcoding-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{mohajer_capacity_2009-1,\n abstract = {We consider multisource non-coherent network coding, where multiple sources send information to one or multiple receivers. We prove that this is equivalent to a ldquosubspacerdquo channel, that takes subspaces as inputs and outputs. We then show that the rate of each individual receiver is upper bounded as deltai(T - delta1 - delta2), where deltai is what we define to be the ldquodominatingrdquo dimension in the subspace codebook of source i, and T is the ldquocoherencerdquo time of the network.},\n type={4},\n author = {Mohajer, S. and Jafari Siavoshani, Mahdi and Diggavi, Suhas N. and Fragouli, C.},\n booktitle = {Networking and {Information} {Theory}, 2009. {ITW} 2009. {IEEE} {Information} {Theory} {Workshop} on},\n doi = {10.1109/itwnit.2009.5158556},\n keywords = {channel capacity, channel codingchannel capacity, multisource noncoherent network coding, subspace codebook},\n month = {June},\n pages = {130--134},\n tags = {network_coding,wireless},\n title = {On the capacity of multisource non-coherent network coding},\n year = {2009}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider multisource non-coherent network coding, where multiple sources send information to one or multiple receivers. We prove that this is equivalent to a ldquosubspacerdquo channel, that takes subspaces as inputs and outputs. We then show that the rate of each individual receiver is upper bounded as deltai(T - delta1 - delta2), where deltai is what we define to be the ldquodominatingrdquo dimension in the subspace codebook of source i, and T is the ldquocoherencerdquo time of the network.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"saeedi-diggavi-fragouli-prabhakaran-ondegradedtwomessagesetbroadcast-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Shirin Saeedi;  Suhas N. Diggavi;  C. Fragouli;  and  V. M. Prabhakaran.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On Degraded Two Message Set Broadcast.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Information Theory Workshop (ITW)</i>,  2009. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/saeedi-diggavi-fragouli-prabhakaran-ondegradedtwomessagesetbroadcast-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('saeedi-diggavi-fragouli-prabhakaran-ondegradedtwomessagesetbroadcast-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{saeedi_degraded_2009,\n abstract = {We consider the two message set problem, where a source broadcasts a common message W1 to an arbitrary set of receivers U and a private message W2 to a subset of the receivers P x U. Transmissions occur over linear deterministic channels. For the case where at most two receivers do not require the private message, we give an exact characterization of the capacity region, where achievability is through linear coding.},\n type={4},\n author = {Saeedi, Shirin and Diggavi, Suhas N. and Fragouli, C. and Prabhakaran, V. M.},\n booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},\n tags = {network_coding,wireless},\n title = {On {Degraded} {Two} {Message} {Set} {Broadcast}},\n year = {2009}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider the two message set problem, where a source broadcasts a common message W1 to an arbitrary set of receivers U and a private message W2 to a subset of the receivers P x U. Transmissions occur over linear deterministic channels. For the case where at most two receivers do not require the private message, we give an exact characterization of the capacity region, where achievability is through linear coding.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sattari-markopoulou-fragouli-multiplesourcemultipledestinationtopologyinferenceusingnetworkcoding-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   P. Sattari;  Athina Markopoulou;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Multiple source multiple destination topology inference using network coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Network Coding, Theory, and Applications, 2009. NetCod '09. Workshop on</i>, pages 36–41, June 2009. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/netcod.2009.5191391\"\n     onclick=\"log_download('sattari-markopoulou-fragouli-multiplesourcemultipledestinationtopologyinferenceusingnetworkcoding-2009', 'http://doi.org/10.1109/netcod.2009.5191391', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sattari-markopoulou-fragouli-multiplesourcemultipledestinationtopologyinferenceusingnetworkcoding-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sattari-markopoulou-fragouli-multiplesourcemultipledestinationtopologyinferenceusingnetworkcoding-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{sattari_multiple_2009,\n abstract = {In this paper, we combine network coding and tomographic techniques for topology inference. Our goal is to infer the topology of a network by sending probes between a given set of multiple sources and multiple receivers and by having intermediate nodes perform network coding operations. We combine and extend two ideas that have been developed independently. On one hand, network coding introduces topology-dependent correlation, which can then be exploited at the receivers to infer the topology. On the other hand, it has been shown that a traditional (i.e., without network coding) multiple source, multiple receiver tomography problem can be decomposed into multiple two source, two receiver subproblems. Our first contribution is to show that, when intermediate nodes perform network coding, topological information contained in network coded packets allows to accurately distinguish among all different 2-by-2 subnetwork components, which was not possible with traditional tomographic techniques. Our second contribution is to use this knowledge to merge the subnetworks and accurately reconstruct the general topology. Our approach is applicable to any general Internet-like topology, and is robust to the presence of delay variability and packet loss.},\n type={4},\n author = {Sattari, P. and Markopoulou, Athina and Fragouli, C.},\n booktitle = {Network {Coding}, {Theory}, and {Applications}, 2009. {NetCod} &#x27;09. {Workshop} on},\n doi = {10.1109/netcod.2009.5191391},\n keywords = {network coding, encoding, multiple source multiple destination topology inference, network coded packets, network topology, receivers, routing protocols, telecommunication network topologycorrelation, tomographic techniques},\n month = {June},\n pages = {36--41},\n tags = {network_coding},\n title = {Multiple source multiple destination topology inference using network coding},\n year = {2009}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper, we combine network coding and tomographic techniques for topology inference. Our goal is to infer the topology of a network by sending probes between a given set of multiple sources and multiple receivers and by having intermediate nodes perform network coding operations. We combine and extend two ideas that have been developed independently. On one hand, network coding introduces topology-dependent correlation, which can then be exploited at the receivers to infer the topology. On the other hand, it has been shown that a traditional (i.e., without network coding) multiple source, multiple receiver tomography problem can be decomposed into multiple two source, two receiver subproblems. Our first contribution is to show that, when intermediate nodes perform network coding, topological information contained in network coded packets allows to accurately distinguish among all different 2-by-2 subnetwork components, which was not possible with traditional tomographic techniques. Our second contribution is to use this knowledge to merge the subnetworks and accurately reconstruct the general topology. Our approach is applicable to any general Internet-like topology, and is robust to the presence of delay variability and packet loss.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2008\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2008')\"\n      onkeypress=\"toggleGroup('group_2008')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2008</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"fragouli-widmer-leboudec-efficientbroadcastingusingnetworkcoding-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  J. Widmer;  and  J.-Y. Le Boudec.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Efficient broadcasting using network coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE/ACM Transactions on Networking</i>, 16: 450–463.  2008.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-widmer-leboudec-efficientbroadcastingusingnetworkcoding-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-widmer-leboudec-efficientbroadcastingusingnetworkcoding-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_efficient_2008,\n abstract = {We consider the problem of broadcasting in an ad hoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless networks since it directly affects battery life and thus network lifetime. We prove that applying ideas from network coding allows to realize significant benefits in terms of energy efficiency for the problem of broadcasting, and propose very simple algorithms that allow to realize these benefits in practice. In particular, our theoretical analysis shows that network coding improves performance by a constant factor in fixed networks. We calculate this factor exactly for some canonical configurations. We then show that in networks where the topology dynamically changes, for example due to mobility, and where operations are restricted to simple distributed algorithms, network coding can offer improvements of a factor of , where is the number of nodes in the network. We use the insights gained from the theoretical analysis to propose low-complexity distributed algorithms for realistic wireless ad hoc scenarios, discuss a number of practical considerations, and evaluate our algorithms through packet level simulation.},\n type={2},\n author = {Fragouli, C. and Widmer, J. and Le Boudec, J.-Y.},\n journal = {IEEE/ACM Transactions on Networking},\n pages = {450--463},\n tags = {network_coding,wireless},\n title = {Efficient broadcasting using network coding},\n volume = {16},\n year = {2008}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider the problem of broadcasting in an ad hoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless networks since it directly affects battery life and thus network lifetime. We prove that applying ideas from network coding allows to realize significant benefits in terms of energy efficiency for the problem of broadcasting, and propose very simple algorithms that allow to realize these benefits in practice. In particular, our theoretical analysis shows that network coding improves performance by a constant factor in fixed networks. We calculate this factor exactly for some canonical configurations. We then show that in networks where the topology dynamically changes, for example due to mobility, and where operations are restricted to simple distributed algorithms, network coding can offer improvements of a factor of , where is the number of nodes in the network. We use the insights gained from the theoretical analysis to propose low-complexity distributed algorithms for realistic wireless ad hoc scenarios, discuss a number of practical considerations, and evaluate our algorithms through packet level simulation.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"jafarisiavoshani-fragouli-diggavi-subspacepropertiesofnetworkcodingandtheirapplications-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Mahdi Jafari Siavoshani;  C. Fragouli;  and  Suhas N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Subspace properties of network coding and their applications.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>.  2008.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/jafarisiavoshani-fragouli-diggavi-subspacepropertiesofnetworkcodingandtheirapplications-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('jafarisiavoshani-fragouli-diggavi-subspacepropertiesofnetworkcodingandtheirapplications-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{jafari_siavoshani_subspace_2008,\n type={2},\n author = {Jafari Siavoshani, Mahdi and Fragouli, C. and Diggavi, Suhas N.},\n journal = {IEEE Transactions on Information Theory},\n tags = {network_coding},\n title = {Subspace properties of network coding and their applications},\n year = {2008}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (6)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"fragouli-networkcodingfordynamicallychangingnetworks-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Network coding for dynamically changing networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE International Wireless Communications and Mobile Computing Conference</i>.  2008.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-networkcodingfordynamicallychangingnetworks-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-networkcodingfordynamicallychangingnetworks-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_network_2008,\n abstract = {We here advocate the case for network coding as a guiding paradigm for the operation of networks that vary in a small time frame, due to node mobility, channel variations, and varying traffic conditions. Three ideas that appeared succesively in time brought in place an elegant operation for network coding in such environments. These are, use of randomized network coding for intermediate node operation, use of generations to avoid synchronization, and use of subspace coding to allow for small packet sizes. Information theoretical performance limits support these results.},\n type={4},\n author = {Fragouli, C.},\n journal = {IEEE International Wireless Communications and Mobile Computing Conference},\n tags = {network_coding,wireless},\n title = {Network coding for dynamically changing networks},\n year = {2008}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We here advocate the case for network coding as a guiding paradigm for the operation of networks that vary in a small time frame, due to node mobility, channel variations, and varying traffic conditions. Three ideas that appeared succesively in time brought in place an elegant operation for network coding in such environments. These are, use of randomized network coding for intermediate node operation, use of generations to avoid synchronization, and use of subspace coding to allow for small packet sizes. Information theoretical performance limits support these results.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"jafarisiavoshani-fragouli-diggavi-onlocatingbyzantineattackers-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Mahdi Jafari Siavoshani;  C. Fragouli;  and  Suhas N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On Locating Byzantine Attackers.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Network Coding Workshop: Theory and Applications</i>.  2008.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/jafarisiavoshani-fragouli-diggavi-onlocatingbyzantineattackers-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('jafarisiavoshani-fragouli-diggavi-onlocatingbyzantineattackers-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{jafari_siavoshani_locating_2008,\n abstract = {We examine networks that employ network coding, and are subject to Byzantine attacks. We consider systems where an appropriate network error correcting scheme is employed that is able to correct (up to a certain number of) Byzantine errors. Given this setup, we formulate the problem of locating these malicious nodes that insert errors. We utilize the subspace properties of (randomized) network coding to develop algorithms to locate the Byzantine attackers.},\n type={4},\n author = {Jafari Siavoshani, Mahdi and Fragouli, C. and Diggavi, Suhas N.},\n journal = {Network Coding Workshop: Theory and Applications},\n tags = {network_coding},\n title = {On {Locating} {Byzantine} {Attackers}},\n year = {2008}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We examine networks that employ network coding, and are subject to Byzantine attacks. We consider systems where an appropriate network error correcting scheme is employed that is able to correct (up to a certain number of) Byzantine errors. Given this setup, we formulate the problem of locating these malicious nodes that insert errors. We utilize the subspace properties of (randomized) network coding to develop algorithms to locate the Byzantine attackers.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"jafarisiavoshani-fragouli-diggavi-noncoherentmultisourcenetworkcoding-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Mahdi Jafari Siavoshani;  C. Fragouli;  and  Suhas N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Noncoherent multi-source network coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE International Symposium on Information Theory (ISIT)</i>.  2008.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/jafarisiavoshani-fragouli-diggavi-noncoherentmultisourcenetworkcoding-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('jafarisiavoshani-fragouli-diggavi-noncoherentmultisourcenetworkcoding-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{jafari_siavoshani_noncoherent_2008,\n abstract = {We examine the problem of multiple sources transmitting information to one or more receivers that require the information from all the sources, over a network where the network nodes perform randomized network coding. We consider the noncoherent case, where neither the sources nor the receivers have any knowledge of the intermediate nodes operations. We formulate a model for this problem, inspired from block- fading noncoherent MIMO communications. We prove, using information theoretic tools, that coding over subspaces is sufficient to achieve the capacity, and give bounds for the capacity. We then examine the associated combinatorial problem of code design. We extend the work by Koetter and Kschischang [3] to code constructions for the multisource case. Our constructions can also be viewed as coding for the noncoherent multiple-access finite-field channel.},\n type={4},\n author = {Jafari Siavoshani, Mahdi and Fragouli, C. and Diggavi, Suhas N.},\n journal = {IEEE International Symposium on Information Theory (ISIT)},\n tags = {network_coding,wireless},\n title = {Noncoherent multi-source network coding},\n year = {2008}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We examine the problem of multiple sources transmitting information to one or more receivers that require the information from all the sources, over a network where the network nodes perform randomized network coding. We consider the noncoherent case, where neither the sources nor the receivers have any knowledge of the intermediate nodes operations. We formulate a model for this problem, inspired from block- fading noncoherent MIMO communications. We prove, using information theoretic tools, that coding over subspaces is sufficient to achieve the capacity, and give bounds for the capacity. We then examine the associated combinatorial problem of code design. We extend the work by Koetter and Kschischang [3] to code constructions for the multisource case. Our constructions can also be viewed as coding for the noncoherent multiple-access finite-field channel.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"keller-drinea-fragouli-onlinebroadcastingwithnetworkcoding-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Keller;  Eleni Drinea;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Online Broadcasting with Network Coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Network Coding, Theory and Applications, 2008. NetCod 2008. Fourth Workshop on</i>, pages 1 – 6, January 2008. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/netcod.2008.4476183\"\n     onclick=\"log_download('keller-drinea-fragouli-onlinebroadcastingwithnetworkcoding-2008', 'http://doi.org/10.1109/netcod.2008.4476183', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/keller-drinea-fragouli-onlinebroadcastingwithnetworkcoding-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('keller-drinea-fragouli-onlinebroadcastingwithnetworkcoding-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{keller_online_2008,\n abstract = {Consider a source broadcasting M packets to N receivers over independent erasure channels, where perfect feedback is available from the receivers to the source, and the source is allowed to use coding. We investigate offline and online algorithms that optimize delay, both through theoretical analysis as well as simulation results.},\n type={4},\n author = {Keller, L. and Drinea, Eleni and Fragouli, C.},\n booktitle = {Network {Coding}, {Theory} and {Applications}, 2008. {NetCod} 2008. {Fourth} {Workshop} on},\n doi = {10.1109/netcod.2008.4476183},\n keywords = {network coding, feedback, broadcasting, encoding, online broadcasting},\n month = {January},\n pages = {1 -- 6},\n tags = {network_coding,wireless},\n title = {Online {Broadcasting} with {Network} {Coding}},\n year = {2008}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Consider a source broadcasting M packets to N receivers over independent erasure channels, where perfect feedback is available from the receivers to the source, and the source is allowed to use coding. We investigate offline and online algorithms that optimize delay, both through theoretical analysis as well as simulation results.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"loyola-souza-widmer-fragouli-networkcodedbroadcastfromcanonicalnetworkstorandomtopologies-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   L. Loyola;  T. De Souza;  J. Widmer;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Network-coded broadcast: from canonical networks to random topologies.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Network Coding Workshop: Theory and Applications</i>.  2008.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/loyola-souza-widmer-fragouli-networkcodedbroadcastfromcanonicalnetworkstorandomtopologies-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('loyola-souza-widmer-fragouli-networkcodedbroadcastfromcanonicalnetworkstorandomtopologies-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{loyola_network-coded_2008,\n abstract = {We consider the problem of finding the minimum number of transmissions in an ad-hoc network for all-to-all broadcasting using network coding. This work generalizes previous results for canonical topologies such as the circle and the wrap around grid to the finite-sized line, and non-wrap-around grid. The latter topologies better reflect network coding in random topologies, since the dissemination of information is &quot;directional&quot;, in a sense that information usually arrives via the neighbors on the path to its originator instead of from all possible directions. We find that while the line topology requires a higher number of transmissions compared to the circle, this is interestingly not the case for the grid. We further present simulation results on a heuristic that estimates the required minimum number of transmissions in random wireless topologies and compare it to the optimum solution, as well as previously proposed heuristics.},\n type={4},\n author = {Loyola, L. and Souza, T. De and Widmer, J. and Fragouli, C.},\n journal = {Network Coding Workshop: Theory and Applications},\n tags = {network_coding,wireless},\n title = {Network-coded broadcast: from canonical networks to random topologies},\n year = {2008}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider the problem of finding the minimum number of transmissions in an ad-hoc network for all-to-all broadcasting using network coding. This work generalizes previous results for canonical topologies such as the circle and the wrap around grid to the finite-sized line, and non-wrap-around grid. The latter topologies better reflect network coding in random topologies, since the dissemination of information is \"directional\", in a sense that information usually arrives via the neighbors on the path to its originator instead of from all possible directions. We find that while the line topology requires a higher number of transmissions compared to the circle, this is interestingly not the case for the grid. We further present simulation results on a heuristic that estimates the required minimum number of transmissions in random wireless topologies and compare it to the optimum solution, as well as previously proposed heuristics.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"mohajer-diggavi-fragouli-tse-transmissiontechniquesforrelayinterferencenetworks-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Mohajer;  Suhas N. Diggavi;  C. Fragouli;  and  D. Tse.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Transmission techniques for relay-interference networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Allerton</i>.  2008.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mohajer-diggavi-fragouli-tse-transmissiontechniquesforrelayinterferencenetworks-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mohajer-diggavi-fragouli-tse-transmissiontechniquesforrelayinterferencenetworks-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{mohajer_transmission_2008,\n abstract = {In this paper we study the relay-interference wireless network, in which relay (helper) nodes are to facilitate competing information flows over a wireless network. We examine this in the context of a deterministic wireless interaction model, which eliminates the channel noise and focuses on the signal interactions. Using this model, we show that almost all the known schemes such as interference suppression, interference alignment and interference separation are necessary for relay-interference networks. In addition, we discover a new interference management technique, which we call interference neutralization, which allows for over-the-air interference removal, without the transmitters having complete access the interfering signals. We show that interference separation, suppression, and neutralization arise in a fundamental manner, since we show complete characterizations for special configurations of the relay-interference network.},\n type={4},\n author = {Mohajer, S. and Diggavi, Suhas N. and Fragouli, C. and Tse, D.},\n journal = {IEEE Allerton},\n tags = {network_coding,wireless},\n title = {Transmission techniques for relay-interference networks},\n year = {2008}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper we study the relay-interference wireless network, in which relay (helper) nodes are to facilitate competing information flows over a wireless network. We examine this in the context of a deterministic wireless interaction model, which eliminates the channel noise and focuses on the signal interactions. Using this model, we show that almost all the known schemes such as interference suppression, interference alignment and interference separation are necessary for relay-interference networks. In addition, we discover a new interference management technique, which we call interference neutralization, which allows for over-the-air interference removal, without the transmitters having complete access the interfering signals. We show that interference separation, suppression, and neutralization arise in a fundamental manner, since we show complete characterizations for special configurations of the relay-interference network.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2007\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2007')\"\n      onkeypress=\"toggleGroup('group_2007')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2007</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"niesen-fragouli-tuninetti-onthecapacityoflinenetworks-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   U. Niesen;  C. Fragouli;  and  D. Tuninetti.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On the capacity of line networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 53: 4039–4058.  2007.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/niesen-fragouli-tuninetti-onthecapacityoflinenetworks-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('niesen-fragouli-tuninetti-onthecapacityoflinenetworks-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{niesen_capacity_2007,\n abstract = {We consider communication through a cascade of discrete memoryless channels (DMCs). The source and destination node of this cascade are allowed to use coding schemes of arbitrary complexity, but the intermediate relay nodes are restricted to process only blocks of a fixed length. We investigate how the processing at the relays must be chosen in order to maximize the capacity of the cascade, that is, the maximum achievable end-to-end rate between the source and the destination. For infinite cascades with fixed intermediate processing length at the relays, we prove that this intermediate processing can be chosen to be identical without loss of optimality, and that the capacity of the cascade coincides with the rate of the best zero-error code of length equal to the block length of the intermediate processing. We further show that for fixed and identical intermediate processing at all relays, convergence of capacity as the length of the cascade goes to infinity is exponentially fast. Finally, we characterize how the block length of the intermediate processing must scale with the length of the cascade to guarantee a constant end-to-end rate. We prove that it is sufficient that the block length scales logarithmically with the network length in order to achieve any rate above the zero-error capacity. We show that in many cases of interest logarithmic growth is also necessary},\n type={2},\n author = {Niesen, U. and Fragouli, C. and Tuninetti, D.},\n journal = {IEEE Transactions on Information Theory},\n pages = {4039--4058},\n tags = {network_coding},\n title = {On the capacity of line networks},\n volume = {53},\n year = {2007}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider communication through a cascade of discrete memoryless channels (DMCs). The source and destination node of this cascade are allowed to use coding schemes of arbitrary complexity, but the intermediate relay nodes are restricted to process only blocks of a fixed length. We investigate how the processing at the relays must be chosen in order to maximize the capacity of the cascade, that is, the maximum achievable end-to-end rate between the source and the destination. For infinite cascades with fixed intermediate processing length at the relays, we prove that this intermediate processing can be chosen to be identical without loss of optimality, and that the capacity of the cascade coincides with the rate of the best zero-error code of length equal to the block length of the intermediate processing. We further show that for fixed and identical intermediate processing at all relays, convergence of capacity as the length of the cascade goes to infinity is exponentially fast. Finally, we characterize how the block length of the intermediate processing must scale with the length of the cascade to guarantee a constant end-to-end rate. We prove that it is sufficient that the block length scales logarithmically with the network length in order to achieve any rate above the zero-error capacity. We show that in many cases of interest logarithmic growth is also necessary\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (10)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"dhulipala-fragouli-orlitsky-singleversusmultipleroundsfordistributedfunctioncomputation-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Anand K. Dhulipala;  C. Fragouli;  and  Alon Orlitsky.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Single versus multiple rounds for distributed function computation.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Information Theory, 2007. ISIT 2007. IEEE International Symposium on</i>, pages 636 –640, June 2007. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/isit.2007.4557296\"\n     onclick=\"log_download('dhulipala-fragouli-orlitsky-singleversusmultipleroundsfordistributedfunctioncomputation-2007', 'http://doi.org/10.1109/isit.2007.4557296', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dhulipala-fragouli-orlitsky-singleversusmultipleroundsfordistributedfunctioncomputation-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dhulipala-fragouli-orlitsky-singleversusmultipleroundsfordistributedfunctioncomputation-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{dhulipala_single_2007,\n abstract = {Communication complexity of computing functions using unrestricted communication and one-round communication are compared. In the standard unrestricted communication each party could potentially communicate several times while in one-round communication each party is restricted to communicate at most once. Results on the ratio of these two complexities are provided for symmetric and asymmetric functions under different scenarios. These results are suitably illustrated with examples.},\n type={4},\n author = {Dhulipala, Anand K. and Fragouli, C. and Orlitsky, Alon},\n booktitle = {Information {Theory}, 2007. {ISIT} 2007. {IEEE} {International} {Symposium} on},\n doi = {10.1109/isit.2007.4557296},\n month = {June},\n pages = {636 --640},\n tags = {CC},\n title = {Single versus multiple rounds for distributed function computation},\n year = {2007}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Communication complexity of computing functions using unrestricted communication and one-round communication are compared. In the standard unrestricted communication each party could potentially communicate several times while in one-round communication each party is restricted to communicate at most once. Results on the ratio of these two complexities are provided for symmetric and asymmetric functions under different scenarios. These results are suitably illustrated with examples.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"dhulipala-fragouli-orlitsky-singleversusmultipleroundsfordistributedfunctioncomputation-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Anand K. Dhulipala;  C. Fragouli;  and  Alon Orlitsky.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Single versus multiple rounds for distributed function computation.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Information Theory, 2007. ISIT 2007. IEEE International Symposium on</i>, pages 636 –640, June 2007. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/isit.2007.4557296\"\n     onclick=\"log_download('dhulipala-fragouli-orlitsky-singleversusmultipleroundsfordistributedfunctioncomputation-2007', 'http://doi.org/10.1109/isit.2007.4557296', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dhulipala-fragouli-orlitsky-singleversusmultipleroundsfordistributedfunctioncomputation-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dhulipala-fragouli-orlitsky-singleversusmultipleroundsfordistributedfunctioncomputation-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{dhulipala_single_2007,\n abstract = {Communication complexity of computing functions using unrestricted communication and one-round communication are compared. In the standard unrestricted communication each party could potentially communicate several times while in one-round communication each party is restricted to communicate at most once. Results on the ratio of these two complexities are provided for symmetric and asymmetric functions under different scenarios. These results are suitably illustrated with examples.},\n type={4},\n author = {Dhulipala, Anand K. and Fragouli, C. and Orlitsky, Alon},\n booktitle = {Information {Theory}, 2007. {ISIT} 2007. {IEEE} {International} {Symposium} on},\n doi = {10.1109/isit.2007.4557296},\n month = {June},\n pages = {636 --640},\n tags = {CC},\n title = {Single versus multiple rounds for distributed function computation},\n year = {2007}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Communication complexity of computing functions using unrestricted communication and one-round communication are compared. In the standard unrestricted communication each party could potentially communicate several times while in one-round communication each party is restricted to communicate at most once. Results on the ratio of these two complexities are provided for symmetric and asymmetric functions under different scenarios. These results are suitably illustrated with examples.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"durvy-fragouli-thiran-onfeedbackfornetworkcoding-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   M. Durvy;  C. Fragouli;  and  P. Thiran.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On feedback for network coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT)</i>,  2007. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/durvy-fragouli-thiran-onfeedbackfornetworkcoding-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('durvy-fragouli-thiran-onfeedbackfornetworkcoding-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{durvy_feedback_2007,\n type={4},\n author = {Durvy, M. and Fragouli, C. and Thiran, P.},\n booktitle = {{IEEE} {International} {Symposium} on {Information} {Theory} ({ISIT})},\n publisher = {IEEE},\n tags = {network_coding},\n title = {On feedback for network coding},\n year = {2007}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"durvy-fragouli-thiran-towardsreliablebroadcastingusingacks-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   M. Durvy;  C. Fragouli;  and  P. Thiran.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Towards reliable broadcasting using ACKs.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>ISIT</i>.  2007.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/durvy-fragouli-thiran-towardsreliablebroadcastingusingacks-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('durvy-fragouli-thiran-towardsreliablebroadcastingusingacks-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{durvy_towards_2007,\n abstract = {We propose a mechanism for reliable broadcasting in wireless networks, that consists of two components: a method for bandwidth efficient acknowledgment collection, and a coding scheme that uses acknowledgments. Our approach combines ideas from network coding and distributed space time coding.},\n type={4},\n author = {Durvy, M. and Fragouli, C. and Thiran, P.},\n journal = {ISIT},\n tags = {network_coding,wireless},\n title = {Towards reliable broadcasting using {ACKs}},\n year = {2007}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We propose a mechanism for reliable broadcasting in wireless networks, that consists of two components: a method for bandwidth efficient acknowledgment collection, and a coding scheme that uses acknowledgments. Our approach combines ideas from network coding and distributed space time coding.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-lun-mdard-pakzad-onfeedbackfornetworkcoding-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  Desmond Lun;  Muriel Médard;  and  Payam Pakzad.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On feedback for network coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>in Proc. of 2007 Conference on Information Sciences and Systems (CISS)</i>,  2007. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-lun-mdard-pakzad-onfeedbackfornetworkcoding-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-lun-mdard-pakzad-onfeedbackfornetworkcoding-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{fragouli_feedback_2007,\n type={4},\n author = {Fragouli, C. and Lun, Desmond and Médard, Muriel and Pakzad, Payam},\n booktitle = {in {Proc}. of 2007 {Conference} on {Information} {Sciences} and {Systems} ({CISS})},\n tags = {network_coding},\n title = {On feedback for network coding},\n year = {2007}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-markopoulou-srinivasan-diggavi-networkmonitoringitdependsonyourpointsofview-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  Athina Markopoulou;  R. Srinivasan;  and  Suhas N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Network monitoring: it depends on your points of view.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>ITA</i>.  2007.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-markopoulou-srinivasan-diggavi-networkmonitoringitdependsonyourpointsofview-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-markopoulou-srinivasan-diggavi-networkmonitoringitdependsonyourpointsofview-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_network_2007,\n abstract = {End-to-end active network monitoring infers network characteristics by sending and collecting probe packets from the network edge, while probes traverse the network through multicast trees or a mesh of unicast paths. Most reported methods consider given source and receiver locations and study the path selection and the associated estimation algorithms. In this paper, we show that appropriately choosing the number of sources and receivers, as well as their location, may have a significant effect on the accuracy of the estimation; we also give guidelines on how to choose the best “points of view” of a network for link loss monitoring purposes. Though this observation applies across all monitoring methods, we consider, in particular, networks where nodes are equipped with network coding capabilities; our framework includes as special cases the scenarios of pure multicast and network coding. We show that, in network-coding enabled networks, multiple source active monitoring can exploit these capabilities to estimate link loss rates more efficiently than purely tomographic methods. To address the complexity of the estimation problem for large networks, we also propose efficient algorithms, including the decomposition into smaller multicast inference problems, belief-propagation, and a MINC-like algorithm.},\n type={4},\n author = {Fragouli, C. and Markopoulou, Athina and Srinivasan, R. and Diggavi, Suhas N.},\n journal = {ITA},\n tags = {network_coding},\n title = {Network monitoring: it depends on your points of view},\n year = {2007}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  End-to-end active network monitoring infers network characteristics by sending and collecting probe packets from the network edge, while probes traverse the network through multicast trees or a mesh of unicast paths. Most reported methods consider given source and receiver locations and study the path selection and the associated estimation algorithms. In this paper, we show that appropriately choosing the number of sources and receivers, as well as their location, may have a significant effect on the accuracy of the estimation; we also give guidelines on how to choose the best “points of view” of a network for link loss monitoring purposes. Though this observation applies across all monitoring methods, we consider, in particular, networks where nodes are equipped with network coding capabilities; our framework includes as special cases the scenarios of pure multicast and network coding. We show that, in network-coding enabled networks, multiple source active monitoring can exploit these capabilities to estimate link loss rates more efficiently than purely tomographic methods. To address the complexity of the estimation problem for large networks, we also propose efficient algorithms, including the decomposition into smaller multicast inference problems, belief-propagation, and a MINC-like algorithm.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-katabi-markopoulou-medard-rahul-wirelessnetworkcodingopportunitiesandchallenges-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  D. Katabi;  Athina Markopoulou;  M. Medard;  and  H. Rahul.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Wireless network coding: opportunities and challenges.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE MILCOM</i>.  2007.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-katabi-markopoulou-medard-rahul-wirelessnetworkcodingopportunitiesandchallenges-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-katabi-markopoulou-medard-rahul-wirelessnetworkcodingopportunitiesandchallenges-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_wireless_2007,\n abstract = {Wireless networks suffer from a variety of unique problems such as low throughput, dead spots, and inadequate support for mobility. However, their characteristics such as the broadcast nature of the medium, spatial diversity, and significant data redundancy, provide opportunities for new design principles to address these problems. There has been recent interest in employing network coding in wireless networks. This paper explores the case for network coding as a unifying design paradigm for wireless networks, by describing how it addresses issues of throughput, reliability, mobility, and management. We also discuss the practical challenges facing the integration of such a design into the network stack.},\n type={4},\n author = {Fragouli, C. and Katabi, D. and Markopoulou, Athina and Medard, M. and Rahul, H.},\n journal = {IEEE MILCOM},\n tags = {network_coding,wireless},\n title = {Wireless network coding: opportunities and challenges},\n year = {2007}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Wireless networks suffer from a variety of unique problems such as low throughput, dead spots, and inadequate support for mobility. However, their characteristics such as the broadcast nature of the medium, spatial diversity, and significant data redundancy, provide opportunities for new design principles to address these problems. There has been recent interest in employing network coding in wireless networks. This paper explores the case for network coding as a unifying design paradigm for wireless networks, by describing how it addresses issues of throughput, reliability, mobility, and management. We also discuss the practical challenges facing the integration of such a design into the network stack.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gjoka-fragouli-sattari-markopoulou-losstomographyingeneraltopologieswithnetworkcoding-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   M. Gjoka;  C. Fragouli;  P. Sattari;  and  Athina Markopoulou.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Loss Tomography in General Topologies with Network Coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE GLOBECOM</i>.  2007.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gjoka-fragouli-sattari-markopoulou-losstomographyingeneraltopologieswithnetworkcoding-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gjoka-fragouli-sattari-markopoulou-losstomographyingeneraltopologieswithnetworkcoding-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{gjoka_loss_2007,\n abstract = {Network tomography infers internal network characteristics by sending and collecting probe packets from the network edge. Traditional tomographic techniques for general topologies typically use a mesh of multicast trees and/or unicast paths to cover the entire graph, which is suboptimal from the point of view of bandwidth efficiency and estimation accuracy. In this paper, we investigate an active probing method for link loss inference in a general topology, where multiple sources and receivers are used and intermediate nodes are equipped with network coding, in addition to unicast and multicast, capabilities. With our approach, each link is traversed by exactly one packet, which is in general a linear combination of the original probes. The receivers infer the loss rate on all links by observing not only the number but also the contents of the received probes. In this paper: (i) we propose an orientation algorithm that creates an acyclic graph with the maximum number of identifiable edges (ii) we define probe combining coding schemes and discuss some of their properties and (iii) we present simulation results over realistic topologies using Belief-Propagation (BP) algorithms.},\n type={4},\n author = {Gjoka, M. and Fragouli, C. and Sattari, P. and Markopoulou, Athina},\n journal = {IEEE GLOBECOM},\n tags = {network_coding},\n title = {Loss {Tomography} in {General} {Topologies} with {Network} {Coding}},\n year = {2007}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Network tomography infers internal network characteristics by sending and collecting probe packets from the network edge. Traditional tomographic techniques for general topologies typically use a mesh of multicast trees and/or unicast paths to cover the entire graph, which is suboptimal from the point of view of bandwidth efficiency and estimation accuracy. In this paper, we investigate an active probing method for link loss inference in a general topology, where multiple sources and receivers are used and intermediate nodes are equipped with network coding, in addition to unicast and multicast, capabilities. With our approach, each link is traversed by exactly one packet, which is in general a linear combination of the original probes. The receivers infer the loss rate on all links by observing not only the number but also the contents of the received probes. In this paper: (i) we propose an orientation algorithm that creates an acyclic graph with the maximum number of identifiable edges (ii) we define probe combining coding schemes and discuss some of their properties and (iii) we present simulation results over realistic topologies using Belief-Propagation (BP) algorithms.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"jafarisiavoshani-fragouli-diggavi-gkantsidis-bottleneckdiscoveryandoverlaymanagementinnetworkcodedpeertopeersystems-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Mahdi Jafari Siavoshani;  C. Fragouli;  Suhas N. Diggavi;  and  C. Gkantsidis.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Bottleneck discovery and overlay management in network coded Peer-to-Peer systems.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>SIGCOMM INM</i>.  2007.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/jafarisiavoshani-fragouli-diggavi-gkantsidis-bottleneckdiscoveryandoverlaymanagementinnetworkcodedpeertopeersystems-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('jafarisiavoshani-fragouli-diggavi-gkantsidis-bottleneckdiscoveryandoverlaymanagementinnetworkcodedpeertopeersystems-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{jafari_siavoshani_bottleneck_2007,\n abstract = {The performance of peer-to-peer (P2P) networks depends critically on the good connectivity of the overlay topology. In this paper we study P2P networks for content distribution (such as Avalanche) that use randomized network coding techniques. The basic idea of such systems is that peers randomly combine and exchange linear combinations of the source packets. A header appended to each packet specifies the linear combination that the packet carries. In this paper we show that the linear combinations a node receives from its neighbors reveal structural information about the network. We propose algorithms to utilize this observation for topology management to avoid bottlenecks and clustering in network-coded P2P systems. Our approach is decentralized, inherently adapts to the network topology, and reduces substantially the number of topology rewirings that are necessary to maintain a well connected overlay. Moreover, this is done passively during the normal content distribution. This work demonstrates another value of using network coding and complements previous work that showed network coding achieves high utilization of the network resources.},\n type={4},\n author = {Jafari Siavoshani, Mahdi and Fragouli, C. and Diggavi, Suhas N. and Gkantsidis, C.},\n journal = {SIGCOMM INM},\n tags = {network_coding},\n title = {Bottleneck discovery and overlay management in network coded {Peer}-to-{Peer} systems},\n year = {2007}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The performance of peer-to-peer (P2P) networks depends critically on the good connectivity of the overlay topology. In this paper we study P2P networks for content distribution (such as Avalanche) that use randomized network coding techniques. The basic idea of such systems is that peers randomly combine and exchange linear combinations of the source packets. A header appended to each packet specifies the linear combination that the packet carries. In this paper we show that the linear combinations a node receives from its neighbors reveal structural information about the network. We propose algorithms to utilize this observation for topology management to avoid bottlenecks and clustering in network-coded P2P systems. Our approach is decentralized, inherently adapts to the network topology, and reduces substantially the number of topology rewirings that are necessary to maintain a well connected overlay. Moreover, this is done passively during the normal content distribution. This work demonstrates another value of using network coding and complements previous work that showed network coding achieves high utilization of the network resources.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"jafarisiavoshani-fragouli-diggavi-subspacepropertiesofrandomizednetworkcoding-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Mahdi Jafari Siavoshani;  C. Fragouli;  and  Suhas N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Subspace properties of randomized network coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Information Theory Workshop (ITW)</i>,  2007. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/jafarisiavoshani-fragouli-diggavi-subspacepropertiesofrandomizednetworkcoding-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('jafarisiavoshani-fragouli-diggavi-subspacepropertiesofrandomizednetworkcoding-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{jafari_siavoshani_subspace_2007,\n abstract = {Randomized network coding has network nodes randomly combine and exchange linear combinations of the source packets. A header appended to the packet, called coding vector, specifies the exact linear combination that each packet carries. The main contribution of this work is to investigate properties of the subspacesspanned by the collected coding vectors in each network node. We use these properties to exhibit the relationship between the network topology and the subspaces collected at the nodes. This allows us to passively infer the network topology for a general class of graphs.},\n type={4},\n author = {Jafari Siavoshani, Mahdi and Fragouli, C. and Diggavi, Suhas N.},\n booktitle = {{IEEE} {Information} {Theory} {Workshop} ({ITW})},\n tags = {network_coding},\n title = {Subspace properties of randomized network coding},\n year = {2007}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Randomized network coding has network nodes randomly combine and exchange linear combinations of the source packets. A header appended to the packet, called coding vector, specifies the exact linear combination that each packet carries. The main contribution of this work is to investigate properties of the subspacesspanned by the collected coding vectors in each network node. We use these properties to exhibit the relationship between the network topology and the subspaces collected at the nodes. This allows us to passively infer the network topology for a general class of graphs.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_5\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_5')\"\n      onkeypress=\"toggleGroup('group_5')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>5</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"fragouli-soljanin-networkcodingfundamentalsandapplications-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  and  E. Soljanin.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Network coding: Fundamentals and Applications.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  Volume 1 of Foundations and Trends in NetworkingNow Publisher,  2007.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-soljanin-networkcodingfundamentalsandapplications-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-soljanin-networkcodingfundamentalsandapplications-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@book{fragouli_network_2007-1,\n type={5},\n author = {Fragouli, C. and Soljanin, E.},\n publisher = {Now Publisher},\n series = {Foundations and {Trends} in {Networking}},\n tags = {network_coding},\n title = {Network coding: {Fundamentals} and {Applications}},\n volume = {1},\n year = {2007}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2006\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2006')\"\n      onkeypress=\"toggleGroup('group_2006')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2006</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (9)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"chekuri-fragouli-soljanin-onachievableinformationratesinsinglesourcenonuniformdemandnetworks-2006\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Chekuri;  C. Fragouli;  and  E. Soljanin.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On achievable information rates in single-source non-uniform demand networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>ISIT</i>.  2006.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/chekuri-fragouli-soljanin-onachievableinformationratesinsinglesourcenonuniformdemandnetworks-2006\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('chekuri-fragouli-soljanin-onachievableinformationratesinsinglesourcenonuniformdemandnetworks-2006')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{chekuri_achievable_2006,\n abstract = {A non-uniform demand network consists of a source and a set of receivers that have different min-cut values from the source. We look at the case where the receivers would like to receive from the source a rate that is (approximately) equal to their min-cut value. We formulate this problem and its relaxations and present preliminary results.},\n type={4},\n author = {Chekuri, C. and Fragouli, C. and Soljanin, E.},\n journal = {ISIT},\n tags = {network_coding},\n title = {On achievable information rates in single-source non-uniform demand networks},\n year = {2006}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  A non-uniform demand network consists of a source and a set of receivers that have different min-cut values from the source. We look at the case where the receivers would like to receive from the source a rate that is (approximately) equal to their min-cut value. We formulate this problem and its relaxations and present preliminary results.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"chekuri-fragouli-soljanin-onaveragethroughputbenefitsandalphabetsizeinnetworkcoding-2006\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Chekuri;  C. Fragouli;  and  E. Soljanin.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On Average Throughput Benefits and Alphabet Size in Network Coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Trans. Inform. Theory</i>.  2006.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/chekuri-fragouli-soljanin-onaveragethroughputbenefitsandalphabetsizeinnetworkcoding-2006\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('chekuri-fragouli-soljanin-onaveragethroughputbenefitsandalphabetsizeinnetworkcoding-2006')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{chekuri_average_2006,\n abstract = {We examine the throughput benefits that network coding offers with respect to the average throughput achievable by routing, where the average throughput refers to the average of the rates that the individual receivers experience. We relate these benefits to the integrality gap of a standard LP formulation for the directed Steiner tree problem. We describe families of configurations over which network coding at most doubles the average throughput, and analyze a class of directed graph configurations with \\$N\\$ receivers where network coding offers benefits proportional to \\${\\textbackslash}sqrtN\\$. We also discuss other throughput measures in networks, and show how in certain classes of networks, the average throughput can be achieved uniformly by all receivers by employing vector routing and channel coding. Finally, we show configurations where use of randomized coding may require an alphabet size exponentially larger than the minimum alphabet size required.},\n type={4},\n author = {Chekuri, C. and Fragouli, C. and Soljanin, E.},\n journal = {IEEE Trans. Inform. Theory},\n tags = {network_coding},\n title = {On {Average} {Throughput} {Benefits} and {Alphabet} {Size} in {Network} {Coding}},\n year = {2006}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We examine the throughput benefits that network coding offers with respect to the average throughput achievable by routing, where the average throughput refers to the average of the rates that the individual receivers experience. We relate these benefits to the integrality gap of a standard LP formulation for the directed Steiner tree problem. We describe families of configurations over which network coding at most doubles the average throughput, and analyze a class of directed graph configurations with $N$ receivers where network coding offers benefits proportional to ${\\}sqrtN$. We also discuss other throughput measures in networks, and show how in certain classes of networks, the average throughput can be achieved uniformly by all receivers by employing vector routing and channel coding. Finally, we show configurations where use of randomized coding may require an alphabet size exponentially larger than the minimum alphabet size required.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"dhulipala-fragouli-orlitsky-silencebasedcommunicationforsensornetworks-2006\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   A. Dhulipala;  C. Fragouli;  and  A. Orlitsky.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Silence based communication for sensor networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>ISIT</i>.  2006.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dhulipala-fragouli-orlitsky-silencebasedcommunicationforsensornetworks-2006\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dhulipala-fragouli-orlitsky-silencebasedcommunicationforsensornetworks-2006')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{dhulipala_silence_2006,\n abstract = {We consider a power-efficient communication model for wireless sensor networks where silence is used to convey information. We study the average-case and worst-case complexities of symmetric functions under this model and describe protocols that achieve them. For binary-input functions, we determine the average complexity. For ternary-input functions, we consider a special type of protocols and provide close lower and upper bounds for their worst-case complexity. We also describe the protocol that achieves the average complexity.},\n type={4},\n author = {Dhulipala, A. and Fragouli, C. and Orlitsky, A.},\n journal = {ISIT},\n tags = {sensor_networks},\n title = {Silence based communication for sensor networks},\n year = {2006}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider a power-efficient communication model for wireless sensor networks where silence is used to convey information. We study the average-case and worst-case complexities of symmetric functions under this model and describe protocols that achieve them. For binary-input functions, we determine the average complexity. For ternary-input functions, we consider a special type of protocols and provide close lower and upper bounds for their worst-case complexity. We also describe the protocol that achieves the average complexity.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-widmer-leboudec-onthebenefitsofnetworkcodingforwirelessapplications-2006\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  J. Widmer;  and  J.-Y. Le Boudec.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On the benefits of network coding for wireless applications.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>2nd Network Coding Workshop</i>.  2006.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-widmer-leboudec-onthebenefitsofnetworkcodingforwirelessapplications-2006\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-widmer-leboudec-onthebenefitsofnetworkcodingforwirelessapplications-2006')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_benefits_2006,\n abstract = {We argue that the main benefits of network coding in a wireless environment might manifest in situations where the topology dynamically changes, and operation is restricted to distributed algorithms that do not employ knowledge about the network environment. We consider several problem instances in this set-up, that include broadcasting information to all nodes of the network and collecting sensor measurements. We show that in many such cases, under some simplifying assumptions, the problem is theoretically equivalent to simple variations of the coupon collector problem. Thus network coding can offer benefits of a factor of \\${\\textbackslash}log n\\$, where \\$n\\$ is the number of nodes and the benefits are in terms of energy efficiency, as was proven in the literature. We present simulation results under more realistic conditions that support this claim.},\n type={4},\n author = {Fragouli, C. and Widmer, J. and Le Boudec, J.-Y.},\n journal = {2nd Network Coding Workshop},\n tags = {network_coding,wireless},\n title = {On the benefits of network coding for wireless applications},\n year = {2006}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We argue that the main benefits of network coding in a wireless environment might manifest in situations where the topology dynamically changes, and operation is restricted to distributed algorithms that do not employ knowledge about the network environment. We consider several problem instances in this set-up, that include broadcasting information to all nodes of the network and collecting sensor measurements. We show that in many such cases, under some simplifying assumptions, the problem is theoretically equivalent to simple variations of the coupon collector problem. Thus network coding can offer benefits of a factor of ${\\}log n$, where $n$ is the number of nodes and the benefits are in terms of energy efficiency, as was proven in the literature. We present simulation results under more realistic conditions that support this claim.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-soljanin-informationflowdecompositionfornetworkcoding-2006\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  and  E. Soljanin.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Information Flow Decomposition for Network Coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Trans. Inform. Theory</i>.  2006.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-soljanin-informationflowdecompositionfornetworkcoding-2006\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-soljanin-informationflowdecompositionfornetworkcoding-2006')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_information_2006,\n abstract = {The famous min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by linear re-encoding at nodes in communications networks, the min-cut rate can be also achieved in multicasting to several sinks. Constructing such coding schemes efficiently is the subject of current research. The main idea in this paper is the identification of structural properties of multicast configurations, by decompositing the information flows into a minimal number of subtrees. This decomposition allows us to show that very different networks are equivalent from the coding point of view, and offers a method to identify such equivalence classes. It also allows us to divide the network coding problem into two almost independent problems: one of graph theory and the other of classical channel coding theory. This approach to network coding enables us to derive tight bounds on the network code alphabet size and calculate the throughput improvement network coding can offer for different configurations. But perhaps the most significant strength of our approach concerns future network coding practice. Namely, we propose algorithms to specify the coding operations at network nodes without the knowledge of the overall network topology. Such decentralized designs facilitate the construction of codes which can easily accommodate future changes in the network, e.g., addition of receivers and loss of links.},\n type={4},\n author = {Fragouli, C. and Soljanin, E.},\n journal = {IEEE Trans. Inform. Theory},\n tags = {network_coding},\n title = {Information {Flow} {Decomposition} for {Network} {Coding}},\n year = {2006}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The famous min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by linear re-encoding at nodes in communications networks, the min-cut rate can be also achieved in multicasting to several sinks. Constructing such coding schemes efficiently is the subject of current research. The main idea in this paper is the identification of structural properties of multicast configurations, by decompositing the information flows into a minimal number of subtrees. This decomposition allows us to show that very different networks are equivalent from the coding point of view, and offers a method to identify such equivalence classes. It also allows us to divide the network coding problem into two almost independent problems: one of graph theory and the other of classical channel coding theory. This approach to network coding enables us to derive tight bounds on the network code alphabet size and calculate the throughput improvement network coding can offer for different configurations. But perhaps the most significant strength of our approach concerns future network coding practice. Namely, we propose algorithms to specify the coding operations at network nodes without the knowledge of the overall network topology. Such decentralized designs facilitate the construction of codes which can easily accommodate future changes in the network, e.g., addition of receivers and loss of links.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-widmer-leboudec-anetworkcodingapproachtoenergyefficientbroadcastingfromtheorytopractice-2006\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  J. Widmer;  and  J.-Y. Le Boudec.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Network Coding Approach to Energy Efficient Broadcasting: from Theory to Practice.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Infocom</i>.  2006.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-widmer-leboudec-anetworkcodingapproachtoenergyefficientbroadcastingfromtheorytopractice-2006\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-widmer-leboudec-anetworkcodingapproachtoenergyefficientbroadcastingfromtheorytopractice-2006')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_network_2006,\n abstract = {We show that network coding allows to realize significant energy savings in a wireless ad-hoc network, when each node of the network is a source that wants to transmit information to all other nodes. Energy efficiency directly affects battery life and thus is a critical design parameter for wireless ad-hoc networks. We propose an implementable method for performing network coding in such a setting. We analyze theoretical cases in detail, and use the insights gained to propose a practical, fully distributed method for realistic wireless ad-hoc scenarios. We address practical issues such as setting the forwarding factor, managing generations, and impact of transmission range. We use theoretical analysis and packet level simulation.},\n type={4},\n author = {Fragouli, C. and Widmer, J. and Le Boudec, J.-Y.},\n journal = {Infocom},\n tags = {network_coding,wireless},\n title = {A {Network} {Coding} {Approach} to {Energy} {Efficient} {Broadcasting}: from {Theory} to {Practice}},\n year = {2006}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We show that network coding allows to realize significant energy savings in a wireless ad-hoc network, when each node of the network is a source that wants to transmit information to all other nodes. Energy efficiency directly affects battery life and thus is a critical design parameter for wireless ad-hoc networks. We propose an implementable method for performing network coding in such a setting. We analyze theoretical cases in detail, and use the insights gained to propose a practical, fully distributed method for realistic wireless ad-hoc scenarios. We address practical issues such as setting the forwarding factor, managing generations, and impact of transmission range. We use theoretical analysis and packet level simulation.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-markopoulou-diggavi-topologyinferenceusingnetworkcoding-2006\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  Athina Markopoulou;  and  Suhas N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Topology inference using network coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Allerton</i>.  2006.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-markopoulou-diggavi-topologyinferenceusingnetworkcoding-2006\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-markopoulou-diggavi-topologyinferenceusingnetworkcoding-2006')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_topology_2006,\n abstract = {The network coding paradigm is based on the idea that independent information flows can be linearly combined throughout the network to give benefits in terms of throughput, complexity etc. In this paper, we explore the application of the network coding paradigm to topology inference. Our goal is to infer the topology of a network using multiple sources and observations at the edges of the network. In particular, we consider networks where multiple sources send probes and intermediate nodes locally combine probe packets (perform XOR-operations in incoming links). In previous works (e.g., Ratnasamy \\&amp;amp; McCanne &#x27;99; Duffield et al &#x27;02), the correlation between the observed packet loss patterns is used to infer the underlying topology. In contrast, our main idea behind using network coding is to introduce correlations among multiple probe packets in a topology dependent manner and also develop algorithms that take advantage of these correlations to infer the network topology from end-host observations. Preliminary numerical results illustrate the performance benefits of this approach. In particular, in the absence of packet loss, we can deterministically infer the topology, with very few probes; in the presence of packet loss, we can rapidly infer topology, even at very small loss rates (which was not the case in previous tomography techniques).},\n type={4},\n author = {Fragouli, C. and Markopoulou, Athina and Diggavi, Suhas N.},\n journal = {Allerton},\n tags = {network_coding},\n title = {Topology inference using network coding},\n year = {2006}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The network coding paradigm is based on the idea that independent information flows can be linearly combined throughout the network to give benefits in terms of throughput, complexity etc. In this paper, we explore the application of the network coding paradigm to topology inference. Our goal is to infer the topology of a network using multiple sources and observations at the edges of the network. In particular, we consider networks where multiple sources send probes and intermediate nodes locally combine probe packets (perform XOR-operations in incoming links). In previous works (e.g., Ratnasamy &amp; McCanne '99; Duffield et al '02), the correlation between the observed packet loss patterns is used to infer the underlying topology. In contrast, our main idea behind using network coding is to introduce correlations among multiple probe packets in a topology dependent manner and also develop algorithms that take advantage of these correlations to infer the network topology from end-host observations. Preliminary numerical results illustrate the performance benefits of this approach. In particular, in the absence of packet loss, we can deterministically infer the topology, with very few probes; in the presence of packet loss, we can rapidly infer topology, even at very small loss rates (which was not the case in previous tomography techniques).\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"lun-pakzad-fragouli-medard-koetter-ananalysisoffinitememoryrandomlinearcodingonpacketstreams-2006\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   D. Lun;  P. Pakzad;  C. Fragouli;  M. Medard;  and  R. Koetter.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  An Analysis of Finite-Memory Random Linear Coding on Packet Streams.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>2nd Network Coding Workshop</i>.  2006.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/lun-pakzad-fragouli-medard-koetter-ananalysisoffinitememoryrandomlinearcodingonpacketstreams-2006\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('lun-pakzad-fragouli-medard-koetter-ananalysisoffinitememoryrandomlinearcodingonpacketstreams-2006')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{lun_analysis_2006,\n abstract = {We consider the following packet coding scheme: The coding node has a fixed, finite memory in which it stores packets formed from an incoming packet stream, and it sends packets formed from random linear combinations of its memory contents. We analyze the scheme in two settings: as a self-contained component in a network providing reliability on a single link, and as a component employed at intermediate nodes in a block-coded end-to-end connection. We believe that the scheme is a good alternative to automatic repeat request when feedback is too slow, too unreliable, or too difficult to implement.},\n type={4},\n author = {Lun, D. and Pakzad, P. and Fragouli, C. and Medard, M. and Koetter, R.},\n journal = {2nd Network Coding Workshop},\n tags = {network_coding},\n title = {An {Analysis} of {Finite}-{Memory} {Random} {Linear} {Coding} on {Packet} {Streams}},\n year = {2006}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider the following packet coding scheme: The coding node has a fixed, finite memory in which it stores packets formed from an incoming packet stream, and it sends packets formed from random linear combinations of its memory contents. We analyze the scheme in two settings: as a self-contained component in a network providing reliability on a single link, and as a component employed at intermediate nodes in a block-coded end-to-end connection. We believe that the scheme is a good alternative to automatic repeat request when feedback is too slow, too unreliable, or too difficult to implement.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"niesen-fragouli-tuninetti-scalinglawsforlinenetworksfromzeroerrortomincutcapacity-2006\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   U. Niesen;  C. Fragouli;  and  D. Tuninetti.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Scaling laws for line networks: from zero-error to min-cut capacity.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>ISIT</i>.  2006.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/niesen-fragouli-tuninetti-scalinglawsforlinenetworksfromzeroerrortomincutcapacity-2006\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('niesen-fragouli-tuninetti-scalinglawsforlinenetworksfromzeroerrortomincutcapacity-2006')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{niesen_scaling_2006,\n abstract = {We consider communication through a cascade of \\$L\\$ identical Discrete Memory less Channels (DMCs).The source and destination node are allowed to use coding schemes of arbitrary complexity, but the intermediate relay nodes are restricted to process only blocks of \\$N\\$ symbols.It is well known that for any \\$L\\$ and \\$N{\\textbackslash}toınfty\\$ the relays can use a capacity achieving code and communicate reliably as long as the rate of this code is below the capacity of the underlying DMC. The capacity of the cascade is hence equal to the network {\\textbackslash}em min-cut capacity.For finite \\$N\\$ and \\$L{\\textbackslash}toınfty\\$, we showed in previous work that the optimal intermediate processing is the highest rate zero-error code of length \\$N\\$ for the underlying DMC.The capacity of the cascade coincides with the rate of this zero-error code, and is always below the {\\textbackslash}em zero-error capacity.In this work, we characterize how \\$N\\$ must scale with \\$L\\$ in order to achieve rates in between the zero-error and the min-cut capacity.In particular, we have observed that \\$N = {\\textbackslash}Theta({\\textbackslash}log L)\\$ is {\\textbackslash}em sufficient to achieve any rate below the min-cut capacity. Here, we develop a novel upper bound on the capacity of cascades with optimal intermediate processing that applies for any \\$(N,L)\\$ pairs and use it to show that \\$N = {\\textbackslash}Theta({\\textbackslash}log L)\\$ is {\\textbackslash}em necessary to achieve certain rates above the zero-error capacity. Furthermore, we propose a method to evaluate our upper bound by establishing a connection with the Set-Cover Problem in algorithms.},\n type={4},\n author = {Niesen, U. and Fragouli, C. and Tuninetti, D.},\n journal = {ISIT},\n tags = {network_coding},\n title = {Scaling laws for line networks: from zero-error to min-cut capacity},\n year = {2006}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider communication through a cascade of $L$ identical Discrete Memory less Channels (DMCs).The source and destination node are allowed to use coding schemes of arbitrary complexity, but the intermediate relay nodes are restricted to process only blocks of $N$ symbols.It is well known that for any $L$ and $N{\\}toınfty$ the relays can use a capacity achieving code and communicate reliably as long as the rate of this code is below the capacity of the underlying DMC. The capacity of the cascade is hence equal to the network \\em min-cut capacity.For finite $N$ and $L{\\}toınfty$, we showed in previous work that the optimal intermediate processing is the highest rate zero-error code of length $N$ for the underlying DMC.The capacity of the cascade coincides with the rate of this zero-error code, and is always below the \\em zero-error capacity.In this work, we characterize how $N$ must scale with $L$ in order to achieve rates in between the zero-error and the min-cut capacity.In particular, we have observed that $N = {\\}Theta({\\}log L)$ is \\em sufficient to achieve any rate below the min-cut capacity. Here, we develop a novel upper bound on the capacity of cascades with optimal intermediate processing that applies for any $(N,L)$ pairs and use it to show that $N = {\\}Theta({\\}log L)$ is \\em necessary to achieve certain rates above the zero-error capacity. Furthermore, we propose a method to evaluate our upper bound by establishing a connection with the Set-Cover Problem in algorithms.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_5\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_5')\"\n      onkeypress=\"toggleGroup('group_5')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>5</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"fragouli-widmer-leboudec-networkcodinganinstantprimer-2006\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  J. Widmer;  and  J.-Y. Le Boudec.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Network coding: an instant primer.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>ACM SIGCOM Computer Communication Review</i>.  2006.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-widmer-leboudec-networkcodinganinstantprimer-2006\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-widmer-leboudec-networkcodinganinstantprimer-2006')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_network_2006-1,\n abstract = {Network coding is a new research area that may have interesting applications in practical networking systems. With network coding, intermediate nodes may send out packets that are linear combinations of previously received information. There are two main benefits of this approach: potential throughput improvements and a high degree of robustness. Robustness translates into loss resilience and facilitates the design of simple distributed algorithms that perform well, even if decisions are based only on partial information. This paper is an instant primer on network coding: we explain what network coding does and how it does it. We also discuss the implications of theoretical results on network coding for realistic settings and show how network coding can be used in practice.},\n type={5},\n author = {Fragouli, C. and Widmer, J. and Le Boudec, J.-Y.},\n journal = {ACM SIGCOM Computer Communication Review},\n tags = {network_coding},\n title = {Network coding: an instant primer},\n year = {2006}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Network coding is a new research area that may have interesting applications in practical networking systems. With network coding, intermediate nodes may send out packets that are linear combinations of previously received information. There are two main benefits of this approach: potential throughput improvements and a high degree of robustness. Robustness translates into loss resilience and facilitates the design of simple distributed algorithms that perform well, even if decisions are based only on partial information. This paper is an instant primer on network coding: we explain what network coding does and how it does it. We also discuss the implications of theoretical results on network coding for realistic settings and show how network coding can be used in practice.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2005\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2005')\"\n      onkeypress=\"toggleGroup('group_2005')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2005</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"fragouli-tabet-conditionsforconstantthroughputinwirelessnetworks-2005\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  and  T. Tabet.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Conditions for constant throughput in wireless networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>ACM Transactions on Sensor Networks</i>, 2: 359–379.  2005.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-tabet-conditionsforconstantthroughputinwirelessnetworks-2005\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-tabet-conditionsforconstantthroughputinwirelessnetworks-2005')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_conditions_2005,\n abstract = {In this paper we propose a set of necessary and sufficient conditions under which the throughput in an ad-hoc network can remain constant as the number of nodes \\$n\\$ increases. Throughput refers to the minimum achievable rate between a source-destination pair for a given routing mechanism and physical model, when the network is shared by \\${\\textbackslash}Theta(n)\\$ randomly chosen source-destination pairs. The main idea is to use a {\\textbackslash}em connectivity graph, that does not represent the actual physical network, but rather the available communication resources. This graph also allows to translate the problem of maximizing t he throughput in ad-hoc networks to the multicommodity flow problem and directly apply related results.},\n type={2},\n author = {Fragouli, C. and Tabet, T.},\n journal = {ACM Transactions on Sensor Networks},\n pages = {359--379},\n tags = {sensor_networks},\n title = {Conditions for constant throughput in wireless networks},\n volume = {2},\n year = {2005}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper we propose a set of necessary and sufficient conditions under which the throughput in an ad-hoc network can remain constant as the number of nodes $n$ increases. Throughput refers to the minimum achievable rate between a source-destination pair for a given routing mechanism and physical model, when the network is shared by ${\\}Theta(n)$ randomly chosen source-destination pairs. The main idea is to use a \\em connectivity graph, that does not represent the actual physical network, but rather the available communication resources. This graph also allows to translate the problem of maximizing t he throughput in ad-hoc networks to the multicommodity flow problem and directly apply related results.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (7)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"chekuri-fragouli-soljanin-onaveragethroughputbenefitsandalphabetsizeinnetworkcoding-2005\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Chekuri;  C. Fragouli;  and  E. Soljanin.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On average throughput benefits and alphabet size in network Coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>ISIT</i>.  2005.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/chekuri-fragouli-soljanin-onaveragethroughputbenefitsandalphabetsizeinnetworkcoding-2005\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('chekuri-fragouli-soljanin-onaveragethroughputbenefitsandalphabetsizeinnetworkcoding-2005')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{chekuri_average_2005,\n abstract = {We analyze a special class of configurations with \\$h\\$ sources and \\$N\\$ receivers to demonstrate the throughput benefits of network coding and deterministic code design. We show that the throughput benefits network coding offers can increase proportionally to \\${\\textbackslash}sqrtN\\$, with respect to the average as well as the minimum throughput. We also show that while for this class of configurations there exists a deterministic coding scheme that realizes these benefits using a binary alphabet, randomized coding may require an exponentially large alphabet size.},\n type={4},\n author = {Chekuri, C. and Fragouli, C. and Soljanin, E.},\n journal = {ISIT},\n tags = {network_coding},\n title = {On average throughput benefits and alphabet size in network {Coding}},\n year = {2005}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We analyze a special class of configurations with $h$ sources and $N$ receivers to demonstrate the throughput benefits of network coding and deterministic code design. We show that the throughput benefits network coding offers can increase proportionally to ${\\}sqrtN$, with respect to the average as well as the minimum throughput. We also show that while for this class of configurations there exists a deterministic coding scheme that realizes these benefits using a binary alphabet, randomized coding may require an exponentially large alphabet size.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-markopoulou-anetworkcodingapproachtonetworkmonitoring-2005\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  and  Athina Markopoulou.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Network Coding Approach to Network Monitoring.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Allerton</i>.  2005.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-markopoulou-anetworkcodingapproachtonetworkmonitoring-2005\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-markopoulou-anetworkcodingapproachtonetworkmonitoring-2005')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_network_2005,\n abstract = {Network Monitoring is a challenging problem that has received a lot of attention in the Internet community, particularly in the context of overlay networks. Independently, recent advances in Network Coding have shown that it is possible to increase network capacity and better share the available resources by allowing intermediate nodes to perform processing operations, in addition to just forwarding packets. In this work, we propose the use of Network Coding techniques to improve Network Monitoring. As a specific application, we use our approach for the well-known problem of network tomography, and in particular for inferring link loss rates from end-to-end measurements. We demonstrate that our approach can decrease the bandwidth used by probes, improve the accuracy of estimation, and decrease the complexity of selecting paths or trees to send probes. Overall, we argue that the use of Network Coding techniques shows great promise for improving several aspects of monitoring in overlay networks.},\n type={4},\n author = {Fragouli, C. and Markopoulou, Athina},\n journal = {Allerton},\n tags = {network_coding},\n title = {A {Network} {Coding} {Approach} to {Network} {Monitoring}},\n year = {2005}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Network Monitoring is a challenging problem that has received a lot of attention in the Internet community, particularly in the context of overlay networks. Independently, recent advances in Network Coding have shown that it is possible to increase network capacity and better share the available resources by allowing intermediate nodes to perform processing operations, in addition to just forwarding packets. In this work, we propose the use of Network Coding techniques to improve Network Monitoring. As a specific application, we use our approach for the well-known problem of network tomography, and in particular for inferring link loss rates from end-to-end measurements. We demonstrate that our approach can decrease the bandwidth used by probes, improve the accuracy of estimation, and decrease the complexity of selecting paths or trees to send probes. Overall, we argue that the use of Network Coding techniques shows great promise for improving several aspects of monitoring in overlay networks.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-orlitsky-silenceisgoldenandtimeismoneypowerawarecommunicationforsensornetworks-2005\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  and  A. Orlitsky.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Silence is golden and time is money: power-aware communication for sensor networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>43rd Annual Allerton Conference on Communication, Control, and Computing</i>,  2005. \n  <span class=\"note\">event-place: University of Illinois, Urbana-Champaign, USA</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-orlitsky-silenceisgoldenandtimeismoneypowerawarecommunicationforsensornetworks-2005\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-orlitsky-silenceisgoldenandtimeismoneypowerawarecommunicationforsensornetworks-2005')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{fragouli_silence_2005,\n type={4},\n author = {Fragouli, C. and Orlitsky, A.},\n booktitle = {43rd {Annual} {Allerton} {Conference} on {Communication}, {Control}, and {Computing}},\n note = {event-place: University of Illinois, Urbana-Champaign, USA},\n tags = {sensor_networks},\n title = {Silence is golden and time is money: power-aware communication for sensor networks},\n year = {2005}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"niesen-fragouli-tuninetti-oncascadedchannelswithfinitecomplexityprocessingatintermediatenodes-2005\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   U. Niesen;  C. Fragouli;  and  D. Tuninetti.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On cascaded channels with finite complexity processing at intermediate nodes.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Allerton</i>.  2005.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/niesen-fragouli-tuninetti-oncascadedchannelswithfinitecomplexityprocessingatintermediatenodes-2005\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('niesen-fragouli-tuninetti-oncascadedchannelswithfinitecomplexityprocessingatintermediatenodes-2005')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{niesen_cascaded_2005,\n abstract = {We consider communication through an infinite cascade of identical discrete memoryless channels. We allow the source and destination nodes to use coding schemes of arbitrary complexity, but restrict the intermediate (relay) nodes to process blocks of a fixed blocklength. We calculate the optimal end-to-end rate, maximized over all possible processings at the relays, and show that it coincides with the end-to-end zero-error capacity. The optimal processing is shown to be identical at each relay and to correspond to a zero-error code. We also show that the rate of convergence to the asymptotic value is exponential in the length of the cascade.},\n type={4},\n author = {Niesen, U. and Fragouli, C. and Tuninetti, D.},\n journal = {Allerton},\n tags = {network_coding},\n title = {On cascaded channels with finite complexity processing at intermediate nodes},\n year = {2005}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider communication through an infinite cascade of identical discrete memoryless channels. We allow the source and destination nodes to use coding schemes of arbitrary complexity, but restrict the intermediate (relay) nodes to process blocks of a fixed blocklength. We calculate the optimal end-to-end rate, maximized over all possible processings at the relays, and show that it coincides with the end-to-end zero-error capacity. The optimal processing is shown to be identical at each relay and to correspond to a zero-error code. We also show that the rate of convergence to the asymptotic value is exponential in the length of the cascade.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"pakzad-fragouli-shokrollahi-codingschemesforlinenetworks-2005\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   P. Pakzad;  C. Fragouli;  and  A. Shokrollahi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Coding schemes for line networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>ISIT</i>.  2005.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/pakzad-fragouli-shokrollahi-codingschemesforlinenetworks-2005\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('pakzad-fragouli-shokrollahi-codingschemesforlinenetworks-2005')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{pakzad_coding_2005,\n abstract = {We consider a simple network, where a source and destination node are connected with a line of erasure channels. It is well known that in order to achieve the min-cut capacity, the intermediate nodes are required to process the information. We propose coding schemes for this setting, and discuss each scheme in terms of complexity, delay, achievable rate, memory requirement, and adaptability to unknown channel parameters. We also briefly discuss how these schemes can be extended to more general networks.},\n type={4},\n author = {Pakzad, P. and Fragouli, C. and Shokrollahi, A.},\n journal = {ISIT},\n tags = {network_coding},\n title = {Coding schemes for line networks},\n year = {2005}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider a simple network, where a source and destination node are connected with a line of erasure channels. It is well known that in order to achieve the min-cut capacity, the intermediate nodes are required to process the information. We propose coding schemes for this setting, and discuss each scheme in terms of complexity, delay, achievable rate, memory requirement, and adaptability to unknown channel parameters. We also briefly discuss how these schemes can be extended to more general networks.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"tuninetti-fragouli-onthethroughputimprovementduetolimitedcomplexityprocessingatrelaynodes-2005\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   D. Tuninetti;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On the throughput improvement due to limited complexity processing at relay nodes.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>ISIT</i>.  2005.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/tuninetti-fragouli-onthethroughputimprovementduetolimitedcomplexityprocessingatrelaynodes-2005\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('tuninetti-fragouli-onthethroughputimprovementduetolimitedcomplexityprocessingatrelaynodes-2005')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{tuninetti_throughput_2005,\n abstract = {We consider a source that transmits information to a receiver by routing it over a communication network represented by a graph and examine rate benefits that finite complexity processing at the intermediate nodes may offer. We show that there exist configurations where the optimal rate is achieved only when coding across independent information streams (channel coding and routing cannot be separated); that optimal processing is a function of the particular set of channel parameters and not only of the network topology; and that there exists a connection between linear codes and routing for a special class of graphs.},\n type={4},\n author = {Tuninetti, D. and Fragouli, C.},\n journal = {ISIT},\n tags = {network_coding},\n title = {On the throughput improvement due to limited complexity processing at relay nodes},\n year = {2005}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider a source that transmits information to a receiver by routing it over a communication network represented by a graph and examine rate benefits that finite complexity processing at the intermediate nodes may offer. We show that there exist configurations where the optimal rate is achieved only when coding across independent information streams (channel coding and routing cannot be separated); that optimal processing is a function of the particular set of channel parameters and not only of the network topology; and that there exists a connection between linear codes and routing for a special class of graphs.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"widmer-fragouli-leboudec-lowcomplexityenergyefficientbroadcastinginwirelessadhocnetworksusingnetworkcoding-2005\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   J. Widmer;  C. Fragouli;  and  J.-Y. Le Boudec.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Low-complexity energy-efficient broadcasting in wireless ad-hoc networks using network coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>1st Network Coding Workshop</i>.  2005.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/widmer-fragouli-leboudec-lowcomplexityenergyefficientbroadcastinginwirelessadhocnetworksusingnetworkcoding-2005\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('widmer-fragouli-leboudec-lowcomplexityenergyefficientbroadcastinginwirelessadhocnetworksusingnetworkcoding-2005')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{widmer_low-complexity_2005,\n abstract = {Energy efficiency, i.e., the amount of battery energy consumed to transmit bits across a wireless link, is a critical design parameter for wireless ad-hoc networks. This paper examines the problem of broadcasting information to all nodes in an ad-hoc network, when a large percentage of the nodes act as sources. For this application, we theoretically quantify the energy savings that network coding can offer in the cases of a line network and a rectangular grid network. We then propose low-complexity distributed algorithms, and demonstrate through simulation that in practice, for random networks, network coding can in fact offer significant benefits in terms of energy consumption.},\n type={4},\n author = {Widmer, J. and Fragouli, C. and Le Boudec, J.-Y.},\n journal = {1st Network Coding Workshop},\n tags = {network_coding,wireless},\n title = {Low-complexity energy-efficient broadcasting in wireless ad-hoc networks using network coding},\n year = {2005}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Energy efficiency, i.e., the amount of battery energy consumed to transmit bits across a wireless link, is a critical design parameter for wireless ad-hoc networks. This paper examines the problem of broadcasting information to all nodes in an ad-hoc network, when a large percentage of the nodes act as sources. For this application, we theoretically quantify the energy savings that network coding can offer in the cases of a line network and a rectangular grid network. We then propose low-complexity distributed algorithms, and demonstrate through simulation that in practice, for random networks, network coding can in fact offer significant benefits in terms of energy consumption.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2004\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2004')\"\n      onkeypress=\"toggleGroup('group_2004')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2004</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (7)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"fragouli-soljanin-onaveragethroughputbenefitsfornetworkcoding-2004\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  and  E. Soljanin.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On Average Throughput Benefits for Network Coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Allerton</i>.  2004.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-soljanin-onaveragethroughputbenefitsfornetworkcoding-2004\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-soljanin-onaveragethroughputbenefitsfornetworkcoding-2004')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_average_2004,\n abstract = {We calculate the average throughput benefit that network coding can offer as compared to routing for different classes of multicast configurations over directed graphs. The averaging is over the throughput each individual receiver experiences. For the cases we examine, network coding at most doubles the average throughput.},\n type={4},\n author = {Fragouli, C. and Soljanin, E.},\n journal = {Allerton},\n tags = {network_coding},\n title = {On {Average} {Throughput} {Benefits} for {Network} {Coding}},\n year = {2004}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We calculate the average throughput benefit that network coding can offer as compared to routing for different classes of multicast configurations over directed graphs. The averaging is over the throughput each individual receiver experiences. For the cases we examine, network coding at most doubles the average throughput.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-soljanin-aconnectionbetweennetworkcodingandconvolutionalcodes-2004\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  and  E. Soljanin.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Connection between Network Coding and Convolutional Codes.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>ICC</i>.  2004.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-soljanin-aconnectionbetweennetworkcodingandconvolutionalcodes-2004\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-soljanin-aconnectionbetweennetworkcodingandconvolutionalcodes-2004')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_connection_2004,\n abstract = {The min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by liner re-encoding at nodes in communications networks, the min-cut rate can be also achieved in multicasting to several sinks. In this paper we discuss connections between such coding schemes and convolutional codes. We propose a method to simplify the convolutionalencoder design that is based on a subtree decompositionof the network line graph, describe the structure of the associated matrices, investigate methods to reduce decoding complexity and discuss possible binary implementation.},\n type={4},\n author = {Fragouli, C. and Soljanin, E.},\n journal = {ICC},\n tags = {network_coding},\n title = {A {Connection} between {Network} {Coding} and {Convolutional} {Codes}},\n year = {2004}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by liner re-encoding at nodes in communications networks, the min-cut rate can be also achieved in multicasting to several sinks. In this paper we discuss connections between such coding schemes and convolutional codes. We propose a method to simplify the convolutionalencoder design that is based on a subtree decompositionof the network line graph, describe the structure of the associated matrices, investigate methods to reduce decoding complexity and discuss possible binary implementation.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-soljanin-decentralizednetworkcoding-2004\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  and  E. Soljanin.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Decentralized Network Coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Information Theory Workshop</i>.  2004.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-soljanin-decentralizednetworkcoding-2004\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-soljanin-decentralizednetworkcoding-2004')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_decentralized_2004,\n abstract = {This paper proposes deterministic algorithms for decentralized network coding. Decentralized coding allows to locally specify the coding operations at network nodes without knowledge of the overall network topology, and to accommodate future changes in the network such as addition of receivers. To the best of our knowledge, these are the first deterministic decentralized algorithms proposed for network coding.},\n type={4},\n author = {Fragouli, C. and Soljanin, E.},\n journal = {Information Theory Workshop},\n tags = {network_coding},\n title = {Decentralized {Network} {Coding}},\n year = {2004}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper proposes deterministic algorithms for decentralized network coding. Decentralized coding allows to locally specify the coding operations at network nodes without knowledge of the overall network topology, and to accommodate future changes in the network such as addition of receivers. To the best of our knowledge, these are the first deterministic decentralized algorithms proposed for network coding.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-soljanin-shokrollahi-networkcodingasacoloringproblem-2004\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  E. Soljanin;  and  A. Shokrollahi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Network Coding as a Coloring Problem.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>CISS</i>.  2004.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-soljanin-shokrollahi-networkcodingasacoloringproblem-2004\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-soljanin-shokrollahi-networkcodingasacoloringproblem-2004')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_network_2004,\n abstract = {We consider a multicast configuration with two sources, and translate the network code design problem to vertex coloring of an appropriately defined graph. This observation enables to derive code design algorithms and alphabet size bounds, as well as establish a connection with a number of well-known results from discrete mathematics that increase our insight in the different trade-offs possible for network coding.},\n type={4},\n author = {Fragouli, C. and Soljanin, E. and Shokrollahi, A.},\n journal = {CISS},\n tags = {network_coding},\n title = {Network {Coding} as a {Coloring} {Problem}},\n year = {2004}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider a multicast configuration with two sources, and translate the network code design problem to vertex coloring of an appropriately defined graph. This observation enables to derive code design algorithms and alphabet size bounds, as well as establish a connection with a number of well-known results from discrete mathematics that increase our insight in the different trade-offs possible for network coding.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-soljanin-subtreedecompositionfornetworkcoding-2004\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  and  E. Soljanin.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Subtree Decomposition for Network Coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>ISIT</i>.  2004.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-soljanin-subtreedecompositionfornetworkcoding-2004\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-soljanin-subtreedecompositionfornetworkcoding-2004')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_subtree_2004,\n abstract = {We propose a subtree decomposition method for network coding. This approach enables derivation of tight bounds on the network code alpha- bet size, makes connections with convolutional codes transparent, allows specification of coding operations at network nodes without the knowledge of the overall network topology, and facilitates design of codes which can easily accommodate future changes in the network, such as addition of receivers and loss of links.},\n type={4},\n author = {Fragouli, C. and Soljanin, E.},\n journal = {ISIT},\n tags = {network_coding},\n title = {Subtree {Decomposition} for {Network} {Coding}},\n year = {2004}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We propose a subtree decomposition method for network coding. This approach enables derivation of tight bounds on the network code alpha- bet size, makes connections with convolutional codes transparent, allows specification of coding operations at network nodes without the knowledge of the overall network topology, and facilitates design of codes which can easily accommodate future changes in the network, such as addition of receivers and loss of links.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-tabet-derdiyok-onthethroughputofadhocnetworksusingconnectivitygraphs-2004\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  T. Tabet;  and  C. Derdiyok.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On the Throughput of Ad-Hoc Networks using Connectivity Graphs.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>42nd Annual Allerton Conference on Communication, Control, and Computing</i>,  2004. \n  <span class=\"note\">event-place: University of Illinois, Urbana-Champaign, USA</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-tabet-derdiyok-onthethroughputofadhocnetworksusingconnectivitygraphs-2004\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-tabet-derdiyok-onthethroughputofadhocnetworksusingconnectivitygraphs-2004')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{fragouli_throughput_2004,\n abstract = {In this paper we propose a set of necessary and sufficient conditions under which the throughput in an ad-hoc network can remain constant as the number of nodes n increases. Throughput refers to the minimum achievable rate between a source-destination pair for a given routing mechanism and physical model, when the network is shared by {\\textbackslash}Theta(n) randomly chosen source-destination pairs. The main idea is to use a connectivity graph, that does not represent the actual physical network, but rather the available communication resources.},\n type={4},\n author = {Fragouli, C. and Tabet, T. and Derdiyok, C.},\n booktitle = {42nd {Annual} {Allerton} {Conference} on {Communication}, {Control}, and {Computing}},\n note = {event-place: University of Illinois, Urbana-Champaign, USA},\n tags = {wireless},\n title = {On the {Throughput} of {Ad}-{Hoc} {Networks} using {Connectivity} {Graphs}},\n year = {2004}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper we propose a set of necessary and sufficient conditions under which the throughput in an ad-hoc network can remain constant as the number of nodes n increases. Throughput refers to the minimum achievable rate between a source-destination pair for a given routing mechanism and physical model, when the network is shared by \\Theta(n) randomly chosen source-destination pairs. The main idea is to use a connectivity graph, that does not represent the actual physical network, but rather the available communication resources.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"tuninetti-fragouli-processingalongthewayforwardingvscoding-2004\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   D. Tuninetti;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Processing along the way: forwarding vs. coding.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>ISITA, Parma</i>.  2004.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/tuninetti-fragouli-processingalongthewayforwardingvscoding-2004\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('tuninetti-fragouli-processingalongthewayforwardingvscoding-2004')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{tuninetti_processing_2004,\n abstract = {We consider a source that transmits to a receiver by routing the information packets over a communication network and examine rate benefits that finite complexity processing at the intermediate nodes may offer. We show that the processing capabilities of the intermediate nodes affect not only the end-to-end achievable rate, but also the optimal routing strategy. For example, there exist network configurations where the maximal throughput is achieved only by coding across independent information streams.},\n type={4},\n author = {Tuninetti, D. and Fragouli, C.},\n journal = {ISITA, Parma},\n tags = {network_coding},\n title = {Processing along the way: forwarding vs. coding},\n year = {2004}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider a source that transmits to a receiver by routing the information packets over a communication network and examine rate benefits that finite complexity processing at the intermediate nodes may offer. We show that the processing capabilities of the intermediate nodes affect not only the end-to-end achievable rate, but also the optimal routing strategy. For example, there exist network configurations where the maximal throughput is achieved only by coding across independent information streams.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2003\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2003')\"\n      onkeypress=\"toggleGroup('group_2003')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2003</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"fragouli-aldhahir-turin-trainingbasedchannelestimationformultipleantennabroadbandtransmissions-2003\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  N. Al-Dhahir;  and  W. Turin.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Training-based channel estimation for multiple-antenna broadband transmissions.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Wireless Communications</i>, vol. 2, no. 2: pages 384–391.  2003.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-aldhahir-turin-trainingbasedchannelestimationformultipleantennabroadbandtransmissions-2003\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-aldhahir-turin-trainingbasedchannelestimationformultipleantennabroadbandtransmissions-2003')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_training-based_2003,\n abstract = {This paper addresses the problem of training sequence design for multiple-antenna transmissions over quasi-static frequency-selective channels. To achieve the channel estimation minimum mean square error, the training sequences transmitted from the multiple antennas must have impulse-like auto correlation and zero cross correlation. We reduce the problem of designing multiple training sequences to the much easier and well-understood problem of designing a single training sequence with impulse-like auto correlation. To this end, we propose to encode the training symbols with a space-time code, that may be the same or different from the space-time code that encodes the information symbols.},\n type={2},\n author = {Fragouli, C. and Al-Dhahir, N. and Turin, W.},\n journal = {IEEE Transactions on Wireless Communications},\n pages = {pages 384--391},\n tags = {wireless,channel_coding},\n title = {Training-based channel estimation for multiple-antenna broadband transmissions},\n volume = {vol. 2, no. 2},\n year = {2003}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper addresses the problem of training sequence design for multiple-antenna transmissions over quasi-static frequency-selective channels. To achieve the channel estimation minimum mean square error, the training sequences transmitted from the multiple antennas must have impulse-like auto correlation and zero cross correlation. We reduce the problem of designing multiple training sequences to the much easier and well-understood problem of designing a single training sequence with impulse-like auto correlation. To this end, we propose to encode the training symbols with a space-time code, that may be the same or different from the space-time code that encodes the information symbols.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2002\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2002')\"\n      onkeypress=\"toggleGroup('group_2002')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2002</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"fragouli-aldhahir-diggavi-turin-prefilteredmbcjrequalizerformimofrequencyselectivechannels-2002\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  N. Al-Dhahir;  Suhas N. Diggavi;  and  W. Turin.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Prefiltered M-BCJR Equalizer for MIMO Frequency-Selective Channels.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Communications</i>, vol. 50, no. 5: pages 742–753.  2002.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-aldhahir-diggavi-turin-prefilteredmbcjrequalizerformimofrequencyselectivechannels-2002\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-aldhahir-diggavi-turin-prefilteredmbcjrequalizerformimofrequencyselectivechannels-2002')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_prefiltered_2002,\n abstract = {This paper addresses the problem of soft equalization for space-time-coded transmissions over frequency-selective fading channels. The structure of the space-time code is embedded in the channel impulse response for efficient joint equalization and decoding. The proposed equalization/decoding approach uses a prefilter to concentrate the effective channel power in a small number of taps followed by a reduced-complexity maximum a posteriori probability (MAP) equalizer/decoder to produce soft decisions. The prefilter introduces residual intersymbol interference which degrades the performance of MAP when applied to the trellis of the shortened channel. However, the shape of the overall shortened channel impulse response allows the M-algorithm to approximate the prefiltered MAP performance with a small number of states. Based on this general framework, we investigate several enhancements such as using different prefilters for the forward and backward recursions, concatenating two trellis steps during decoding, and temporal oversampling. The performance is evaluated through simulations over the EDGE typical urban channel.},\n type={2},\n author = {Fragouli, C. and Al-Dhahir, N. and Diggavi, Suhas N. and Turin, W.},\n journal = {IEEE Transactions on Communications},\n pages = {pages 742--753},\n tags = {wireless,channel_coding},\n title = {Prefiltered {M}-{BCJR} {Equalizer} for {MIMO} {Frequency}-{Selective} {Channels}},\n volume = {vol. 50, no. 5},\n year = {2002}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper addresses the problem of soft equalization for space-time-coded transmissions over frequency-selective fading channels. The structure of the space-time code is embedded in the channel impulse response for efficient joint equalization and decoding. The proposed equalization/decoding approach uses a prefilter to concentrate the effective channel power in a small number of taps followed by a reduced-complexity maximum a posteriori probability (MAP) equalizer/decoder to produce soft decisions. The prefilter introduces residual intersymbol interference which degrades the performance of MAP when applied to the trellis of the shortened channel. However, the shape of the overall shortened channel impulse response allows the M-algorithm to approximate the prefiltered MAP performance with a small number of states. Based on this general framework, we investigate several enhancements such as using different prefilters for the forward and backward recursions, concatenating two trellis steps during decoding, and temporal oversampling. The performance is evaluated through simulations over the EDGE typical urban channel.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"komninakis-fragouli-sayed-wesel-multiinputmultioutputfadingchanneltrackingandequalizationusingkalmanestimation-2002\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Komninakis;  C. Fragouli;  A. H. Sayed;  and  R. D. Wesel.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Multi-Input Multi-Output Fading Channel Tracking and Equalization using Kalman Estimation.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Signal Processing</i>, vol. 50: pages 1065–1076.  2002.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/komninakis-fragouli-sayed-wesel-multiinputmultioutputfadingchanneltrackingandequalizationusingkalmanestimation-2002\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('komninakis-fragouli-sayed-wesel-multiinputmultioutputfadingchanneltrackingandequalizationusingkalmanestimation-2002')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{komninakis_multi-input_2002,\n abstract = {This paper addresses the problem of channel tracking and equalization for multi-input multi-output (MIMO) time-varying frequency-selective channels. These channels model the effects of inter-symbol interference (ISI), co-channel interference (CCI), and noise. A low-order autoregressive model approximates the MIMO channel variation and facilitates tracking via a Kalman filter. Hard decisions to aid Kalman tracking come from a MIMO finite-length minimum-mean-squared-error decision-feedback equalizer (MMSE-DFE), which performs the equalization task. Since the optimum DFE for a wide range of channels produces decisions with a delay \\&amp;gt; 0, the Kalman filter tracks the channel with a delay. A channel prediction module bridges the time gap between the channel estimates produced by the Kalman filter and those needed for the DFE adaptation. The proposed algorithm offers good tracking behavior for multiuser fading ISI channels at the expense of higher complexity than conventional adaptive algorithms. Applications include synchronous multiuser detection of independent transmitters, as well as coordinated transmission through many transmitter/receiver antennas, for increased data rate.},\n type={2},\n author = {Komninakis, C. and Fragouli, C. and Sayed, A. H. and Wesel, R. D.},\n journal = {IEEE Transactions on Signal Processing},\n pages = {pages 1065--1076},\n tags = {wireless},\n title = {Multi-{Input} {Multi}-{Output} {Fading} {Channel} {Tracking} and {Equalization} using {Kalman} {Estimation}},\n volume = {vol. 50},\n year = {2002}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper addresses the problem of channel tracking and equalization for multi-input multi-output (MIMO) time-varying frequency-selective channels. These channels model the effects of inter-symbol interference (ISI), co-channel interference (CCI), and noise. A low-order autoregressive model approximates the MIMO channel variation and facilitates tracking via a Kalman filter. Hard decisions to aid Kalman tracking come from a MIMO finite-length minimum-mean-squared-error decision-feedback equalizer (MMSE-DFE), which performs the equalization task. Since the optimum DFE for a wide range of channels produces decisions with a delay &gt; 0, the Kalman filter tracks the channel with a delay. A channel prediction module bridges the time gap between the channel estimates produced by the Kalman filter and those needed for the DFE adaptation. The proposed algorithm offers good tracking behavior for multiuser fading ISI channels at the expense of higher complexity than conventional adaptive algorithms. Applications include synchronous multiuser detection of independent transmitters, as well as coordinated transmission through many transmitter/receiver antennas, for increased data rate.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (8)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"aldhahir-fragouli-howtochoosethenumberoftapsinadfe-2002\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   N. Al-Dhahir;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  How to choose the number of taps in a DFE?.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>CISS 2002</i>.  2002.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/aldhahir-fragouli-howtochoosethenumberoftapsinadfe-2002\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('aldhahir-fragouli-howtochoosethenumberoftapsinadfe-2002')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{al-dhahir_how_2002,\n abstract = {In this paper, we address the following problem. Given a fixed total number of feedforward and feedback filter taps in a decision feedback equalizer, what is the optimum number of taps of each filter and what is the optimum delay setting? We propose a simple algorithm that reduces the solution search space from being two-dimensional to one-dimensional at a small performance loss. We demosntrate the application of our algorithm for indoor wireless channels.},\n type={4},\n author = {Al-Dhahir, N. and Fragouli, C.},\n journal = {CISS 2002},\n tags = {wireless},\n title = {How to choose the number of taps in a {DFE}?},\n year = {2002}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper, we address the following problem. Given a fixed total number of feedforward and feedback filter taps in a decision feedback equalizer, what is the optimum number of taps of each filter and what is the optimum delay setting? We propose a simple algorithm that reduces the solution search space from being two-dimensional to one-dimensional at a small performance loss. We demosntrate the application of our algorithm for indoor wireless channels.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"aldhahir-fragouli-howtochoosethenumberoftapsinadfe-2002\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   N. Al-Dhahir;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  How to choose the number of taps in a DFE?.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>CISS 2002</i>.  2002.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/aldhahir-fragouli-howtochoosethenumberoftapsinadfe-2002\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('aldhahir-fragouli-howtochoosethenumberoftapsinadfe-2002')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{al-dhahir_how_2002,\n abstract = {In this paper, we address the following problem. Given a fixed total number of feedforward and feedback filter taps in a decision feedback equalizer, what is the optimum number of taps of each filter and what is the optimum delay setting? We propose a simple algorithm that resudes the solution search space from being two-dimensional to one-dimensional at a small performance loss. We demosntrate the application of our algorithm for indoor wireless channels.},\n type={4},\n author = {Al-Dhahir, N. and Fragouli, C.},\n journal = {CISS 2002},\n tags = {wireless},\n title = {How to choose the number of taps in a {DFE}?},\n year = {2002}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper, we address the following problem. Given a fixed total number of feedforward and feedback filter taps in a decision feedback equalizer, what is the optimum number of taps of each filter and what is the optimum delay setting? We propose a simple algorithm that resudes the solution search space from being two-dimensional to one-dimensional at a small performance loss. We demosntrate the application of our algorithm for indoor wireless channels.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"aldhahir-fragouli-stamoulis-younis-calderbank-spacetimecodingforbroadbandwirelesstransmission-2002\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   N. Al-Dhahir;  C. Fragouli;  A. Stamoulis;  W. Younis;  and  A. R. Calderbank.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Space-Time Coding for Broadband Wireless Transmission.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Communications Magazine issue “Technologies for 3G and Beyond”</i>, vol. 40, no. 9: pages 136–142.  2002.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/aldhahir-fragouli-stamoulis-younis-calderbank-spacetimecodingforbroadbandwirelesstransmission-2002\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('aldhahir-fragouli-stamoulis-younis-calderbank-spacetimecodingforbroadbandwirelesstransmission-2002')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{al-dhahir_space-time_2002,\n abstract = {We present an overview of research activities on space-time coding for broadband wireless transmission performed at AT\\&amp;amp;T Shannon Laboratory over the past two years. The emphasis is on physical layer modem algorithms such as channel estimation, equalization, and interference cancellation. However, we also discuss the impact of space-time coding gains at the physical layer on throughput at or above the networking layer. Furthermore, we describe a flexible graphical user interface attached to our physical layer simulation engine in order to explore the performance of space-time codes under a variety of practical transmission scenarios. Simulation results for the EDGE cellular system and the 802.11 wireless LAN environment are presented.},\n type={4},\n author = {Al-Dhahir, N. and Fragouli, C. and Stamoulis, A. and Younis, W. and Calderbank, A. R.},\n journal = {IEEE Communications Magazine issue “Technologies for 3G and Beyond”},\n pages = {pages 136--142},\n tags = {wireless,channel_coding},\n title = {Space-{Time} {Coding} for {Broadband} {Wireless} {Transmission}},\n volume = {vol. 40, no. 9},\n year = {2002}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We present an overview of research activities on space-time coding for broadband wireless transmission performed at AT&amp;T Shannon Laboratory over the past two years. The emphasis is on physical layer modem algorithms such as channel estimation, equalization, and interference cancellation. However, we also discuss the impact of space-time coding gains at the physical layer on throughput at or above the networking layer. Furthermore, we describe a flexible graphical user interface attached to our physical layer simulation engine in order to explore the performance of space-time codes under a variety of practical transmission scenarios. Simulation results for the EDGE cellular system and the 802.11 wireless LAN environment are presented.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-aldhahir-turin-effectofspatiotemporalchannelcorrelationontheperformanceofspacetimecodes-2002\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  N. Al-Dhahir;  and  W. Turin.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Effect of Spatio-Temporal Channel Correlation on the Performance of Space-Time Codes.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>ICC 2002, NY</i>, vol. 2: pages 826–830.  2002.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-aldhahir-turin-effectofspatiotemporalchannelcorrelationontheperformanceofspacetimecodes-2002\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-aldhahir-turin-effectofspatiotemporalchannelcorrelationontheperformanceofspacetimecodes-2002')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_effect_2002,\n abstract = {The determinant and rank criteria used for space-time code design apply at high SNR. Code design metrics developed for low SNR assume a channel autocorrelation matrix with equal eigenvalues, which does not hold in many practical scenarios. This paper shows that a space-time code designed to ensure full diversity at high SNR can suffer significant degradation when implemented at low-to-medium SNR because of the channel autocorrelation profile. We examine the effect of the channel autocorrelation matrix on a space-time code&#x27;s performance and discuss how knowledge of this matrix can be used for code design, particularly from the aspect of space-time trellis code minimum memory requirements. Our discussion applies to both flat-fading and frequency-selective channels that are treated in a unified manner.},\n type={4},\n author = {Fragouli, C. and Al-Dhahir, N. and Turin, W.},\n journal = {ICC 2002, NY},\n pages = {pages 826--830},\n tags = {wireless,channel_coding},\n title = {Effect of {Spatio}-{Temporal} {Channel} {Correlation} on the {Performance} of {Space}-{Time} {Codes}},\n volume = {vol. 2},\n year = {2002}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The determinant and rank criteria used for space-time code design apply at high SNR. Code design metrics developed for low SNR assume a channel autocorrelation matrix with equal eigenvalues, which does not hold in many practical scenarios. This paper shows that a space-time code designed to ensure full diversity at high SNR can suffer significant degradation when implemented at low-to-medium SNR because of the channel autocorrelation profile. We examine the effect of the channel autocorrelation matrix on a space-time code's performance and discuss how knowledge of this matrix can be used for code design, particularly from the aspect of space-time trellis code minimum memory requirements. Our discussion applies to both flat-fading and frequency-selective channels that are treated in a unified manner.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-aldhahir-turin-finitealphabetconstantamplitudetrainingsequencesformultipleantennas-2002\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  N. Al-Dhahir;  and  W. Turin.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Finite-Alphabet Constant-Amplitude Training Sequences for Multiple-Antennas.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>ICC 2002, NY</i>, vol. 25, no. 1: pages 6–10.  2002.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-aldhahir-turin-finitealphabetconstantamplitudetrainingsequencesformultipleantennas-2002\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-aldhahir-turin-finitealphabetconstantamplitudetrainingsequencesformultipleantennas-2002')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_finite-alphabet_2002,\n abstract = {We propose a method to identify training sequences for multiple-antenna transmissions over quasi-static frequency-selective channels. These sequences are constructed to belong to a standard constant-amplitude 2m-PSK constellation (such as BPSK, QPSK etc) to simplify the transmitter/receiver implementation. Many practical systems use training of predetermined length. Optimal sequences do not exist for all training sequence lengths and constellation alphabets. The proposed method allows us to identify training sequences that belong to a standard constellation for an arbitrary training sequence length and an arbitrary number of unknown channel taps. Performance bounds derived indicate that these sequences achieve near-optimum performance.},\n type={4},\n author = {Fragouli, C. and Al-Dhahir, N. and Turin, W.},\n journal = {ICC 2002, NY},\n pages = {pages 6--10},\n tags = {wireless,channel_coding},\n title = {Finite-{Alphabet} {Constant}-{Amplitude} {Training} {Sequences} for {Multiple}-{Antennas}},\n volume = {vol. 25, no. 1},\n year = {2002}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We propose a method to identify training sequences for multiple-antenna transmissions over quasi-static frequency-selective channels. These sequences are constructed to belong to a standard constant-amplitude 2m-PSK constellation (such as BPSK, QPSK etc) to simplify the transmitter/receiver implementation. Many practical systems use training of predetermined length. Optimal sequences do not exist for all training sequence lengths and constellation alphabets. The proposed method allows us to identify training sequences that belong to a standard constellation for an arbitrary training sequence length and an arbitrary number of unknown channel taps. Performance bounds derived indicate that these sequences achieve near-optimum performance.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-aldhahir-turin-reducedcomplexitytrainingschemesformultipleantennabroadbandtransmissions-2002\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  N. Al-Dhahir;  and  W. Turin.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Reduced-Complexity Training Schemes for Multiple-Antenna Broadband Transmissions.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>WCNC 2002</i>, vol. 3: 78–83.  2002.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-aldhahir-turin-reducedcomplexitytrainingschemesformultipleantennabroadbandtransmissions-2002\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-aldhahir-turin-reducedcomplexitytrainingschemesformultipleantennabroadbandtransmissions-2002')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_reduced-complexity_2002,\n abstract = {This paper addresses the problem of training sequence design for multiple-antenna transmissions over quasi-static frequency-selective channels. As performance metric for channel estimation, mean square error is adopted. To achieve the minimum mean square error, the training sequences transmitted from the multiple antennas must have impulse-like auto-correlation and zero cross-correlation. We reduce the problem of designing multiple training sequences to the much easier and well-understood problem of designing a single training sequence with impulse-like auto-correlation. To this end, we propose to encode the training sequences with a space-time code, that may be the same or different from the space-time code that encodes the information symbols. Designing one instead of multiple training sequences reduces the search space significantly and simplifies the construction of optimal or suboptimal training sequences.},\n type={4},\n author = {Fragouli, C. and Al-Dhahir, N. and Turin, W.},\n journal = {WCNC 2002},\n pages = {78--83},\n tags = {wireless,channel_coding},\n title = {Reduced-{Complexity} {Training} {Schemes} for {Multiple}-{Antenna} {Broadband} {Transmissions}},\n volume = {vol. 3},\n year = {2002}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper addresses the problem of training sequence design for multiple-antenna transmissions over quasi-static frequency-selective channels. As performance metric for channel estimation, mean square error is adopted. To achieve the minimum mean square error, the training sequences transmitted from the multiple antennas must have impulse-like auto-correlation and zero cross-correlation. We reduce the problem of designing multiple training sequences to the much easier and well-understood problem of designing a single training sequence with impulse-like auto-correlation. To this end, we propose to encode the training sequences with a space-time code, that may be the same or different from the space-time code that encodes the information symbols. Designing one instead of multiple training sequences reduces the search space significantly and simplifies the construction of optimal or suboptimal training sequences.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-polydoros-seriallyconcatenatedcodingforbroadcastingsumtsapplications-2002\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  and  A. Polydoros.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Serially concatenated coding for broadcasting S-UMTS applications.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Seventh International Symposium on Spread Spectrum Techniques and Applications</i>, vol. 3: pages 697–701.  2002.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-polydoros-seriallyconcatenatedcodingforbroadcastingsumtsapplications-2002\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-polydoros-seriallyconcatenatedcodingforbroadcastingsumtsapplications-2002')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_serially_2002,\n abstract = {Satellite-UMTS supports broadcast applications that involve transmission of the same encoded data over channels that may vary significantly. The same code must allow a user with a good channel to recover the information with low complexity, while a user with a bad channel should still be able to achieve an acceptable BER at the cost of increased complexity and/or decoding delay. To this end, we propose serially concatenated multilevel code structures that employ PSK modulation. The receiver has the flexibility to achieve turbo-code, trellis-code or uncoded performance, depending on the decoding effort. Design considerations include the constituent encoder design and the use of a non-uniform constellation. Simulation results investigate the system&#x27;s performance and highlight different parameters trade-offs.},\n type={4},\n author = {Fragouli, C. and Polydoros, A.},\n journal = {IEEE Seventh International Symposium on Spread Spectrum Techniques and Applications},\n pages = {pages 697--701},\n tags = {wireless,channel_coding},\n title = {Serially concatenated coding for broadcasting {S}-{UMTS} applications},\n volume = {vol. 3},\n year = {2002}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Satellite-UMTS supports broadcast applications that involve transmission of the same encoded data over channels that may vary significantly. The same code must allow a user with a good channel to recover the information with low complexity, while a user with a bad channel should still be able to achieve an acceptable BER at the cost of increased complexity and/or decoding delay. To this end, we propose serially concatenated multilevel code structures that employ PSK modulation. The receiver has the flexibility to achieve turbo-code, trellis-code or uncoded performance, depending on the decoding effort. Design considerations include the constituent encoder design and the use of a non-uniform constellation. Simulation results investigate the system's performance and highlight different parameters trade-offs.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-polydoros-symbolinterleavedseriallyconcatenatedturbocodes-2002\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  and  A. Polydoros.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Symbol-Interleaved Serially Concatenated Turbo Codes.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>CISS 2002</i>.  2002.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-polydoros-symbolinterleavedseriallyconcatenatedturbocodes-2002\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-polydoros-symbolinterleavedseriallyconcatenatedturbocodes-2002')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_symbol-interleaved_2002,\n type={4},\n author = {Fragouli, C. and Polydoros, A.},\n journal = {CISS 2002},\n tags = {channel_coding},\n title = {Symbol-{Interleaved} {Serially} {Concatenated} {Turbo} {Codes}},\n year = {2002}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2001\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2001')\"\n      onkeypress=\"toggleGroup('group_2001')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2001</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"fragouli-seshadri-turin-reducedtrellisequalizationusingavariationofthembcjralgorithm-2001\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  N. Seshadri;  and  W. Turin.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Reduced-trellis equalization using a variation of the M-BCJR algorithm.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Journal on Wireless Communications and Mobile Computing</i>, vol. 1: pages 397–406.  2001.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-seshadri-turin-reducedtrellisequalizationusingavariationofthembcjralgorithm-2001\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-seshadri-turin-reducedtrellisequalizationusingavariationofthembcjralgorithm-2001')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_reduced-trellis_2001,\n type={2},\n author = {Fragouli, C. and Seshadri, N. and Turin, W.},\n journal = {Journal on Wireless Communications and Mobile Computing},\n pages = {pages 397--406},\n tags = {channel_coding},\n title = {Reduced-trellis equalization using a variation of the {M}-{BCJR} algorithm},\n volume = {vol. 1},\n year = {2001}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-wesel-turboencoderdesignforsymbolinterleavedparallelconcatenatedtrelliscodedmodulation-2001\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  and  R. D. Wesel.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Turbo encoder design for symbol interleaved parallel concatenated trellis coded modulation.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Communications, no. 3</i>, vol. 49: pages 425–435.  2001.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-wesel-turboencoderdesignforsymbolinterleavedparallelconcatenatedtrelliscodedmodulation-2001\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-wesel-turboencoderdesignforsymbolinterleavedparallelconcatenatedtrelliscodedmodulation-2001')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_turbo_2001,\n abstract = {This paper addresses turbo-encoder design for coding with high spectral efficiency using parallel concatenated trellis-coded modulation and symbol interleaving. The turbo-encoder design involves the constituent encoder design and the interleaver design. The constituent encoders are optimized for symbol-wise effective free distance, and each has an infinite symbol-wise impulse response. We identify the canonical structures for the constituent encoder search space. In many cases of practical interest, the optimal structure for these constituent encoders connects the memory elements in a single row. This single row generally applies to turbo code constituent encoders for parallel concatenation and is not restricted to symbol interleaving. To lower the error floor, a new semi-random interleaver design criteria and a construction method extends the spread-interleaver concept introduced by Divsalar and Pollara (1995). Simulation results show that the proposed system employing symbol interleaving can converge at a lower signal-to-noise ratio than previously reported systems. We report simulation results between 0.5 and 0.6 db from constrained capacity for rates of 2 and 4 bits/s/Hz.},\n type={2},\n author = {Fragouli, C. and Wesel, R. D.},\n journal = {IEEE Transactions on Communications, no. 3},\n pages = {pages 425--435},\n tags = {channel_coding},\n title = {Turbo encoder design for symbol interleaved parallel concatenated trellis coded modulation},\n volume = {vol. 49},\n year = {2001}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper addresses turbo-encoder design for coding with high spectral efficiency using parallel concatenated trellis-coded modulation and symbol interleaving. The turbo-encoder design involves the constituent encoder design and the interleaver design. The constituent encoders are optimized for symbol-wise effective free distance, and each has an infinite symbol-wise impulse response. We identify the canonical structures for the constituent encoder search space. In many cases of practical interest, the optimal structure for these constituent encoders connects the memory elements in a single row. This single row generally applies to turbo code constituent encoders for parallel concatenation and is not restricted to symbol interleaving. To lower the error floor, a new semi-random interleaver design criteria and a construction method extends the spread-interleaver concept introduced by Divsalar and Pollara (1995). Simulation results show that the proposed system employing symbol interleaving can converge at a lower signal-to-noise ratio than previously reported systems. We report simulation results between 0.5 and 0.6 db from constrained capacity for rates of 2 and 4 bits/s/Hz.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"fragouli-wesel-bitvssymbolinterleavingforparallelconcatenatedtrelliscodedmodulation-2001\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  and  R. D. Wesel.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Bit vs. Symbol Interleaving for Parallel Concatenated Trellis Coded Modulation.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>GlobeCom</i>, vol. 2: pages 931–935.  2001.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-wesel-bitvssymbolinterleavingforparallelconcatenatedtrelliscodedmodulation-2001\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-wesel-bitvssymbolinterleavingforparallelconcatenatedtrelliscodedmodulation-2001')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_bit_2001,\n abstract = {This paper compares bit versus symbol interleaving for parallel-concatenated trellis-coded turbo codes, employing the turbo encoder structure proposed in Benedetto et al., (1996). To compare systems optimized with the same techniques, the paper extends the turbo-encoder design procedure proposed in Fragouli et al. (2001), to bit-interleaved systems. We discuss a method to jointly design the multiple required interleavers for the bit-interleaved system, and a procedure to select constituent encoders that can take advantage of the interleaver structure to achieve a low error floor. Simulation results for the designed bit-interleaved system show better performance than bit-interleaved performance reported in the literature. The symbol-interleaved system though achieves an earlier convergence, especially with an increased number of decoder iterations, but at the cost of a slightly higher error floor.},\n type={4},\n author = {Fragouli, C. and Wesel, R. D.},\n journal = {GlobeCom},\n pages = {pages 931--935},\n tags = {channel_coding},\n title = {Bit vs. {Symbol} {Interleaving} for {Parallel} {Concatenated} {Trellis} {Coded} {Modulation}},\n volume = {vol. 2},\n year = {2001}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper compares bit versus symbol interleaving for parallel-concatenated trellis-coded turbo codes, employing the turbo encoder structure proposed in Benedetto et al., (1996). To compare systems optimized with the same techniques, the paper extends the turbo-encoder design procedure proposed in Fragouli et al. (2001), to bit-interleaved systems. We discuss a method to jointly design the multiple required interleavers for the bit-interleaved system, and a procedure to select constituent encoders that can take advantage of the interleaver structure to achieve a low error floor. Simulation results for the designed bit-interleaved system show better performance than bit-interleaved performance reported in the literature. The symbol-interleaved system though achieves an earlier convergence, especially with an increased number of decoder iterations, but at the cost of a slightly higher error floor.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-komninakis-wesel-minimalityforpuncturingconvolutionalcodes-2001\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  C. Komninakis;  and  R. D. Wesel.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Minimality for puncturing convolutional codes.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>ICC 2001, Helsinki, Finland, June</i>, vol. 1: pages 300–304.  2001.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-komninakis-wesel-minimalityforpuncturingconvolutionalcodes-2001\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-komninakis-wesel-minimalityforpuncturingconvolutionalcodes-2001')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_minimality_2001,\n abstract = {This paper investigates encoders optimization for the Hamming weight after periodic puncturing, and discusses minimality issues that may affect the performance of the punctured encoders. Periodically puncturing a minimal encoder produces a higher rate encoder that may or may not be minimal. If it is not minimal, it may have a zero-output loop and it may be catastrophic. A code search can use a fast algorithm to determine whether an encoder&#x27;s state diagram has a zero-output loop under periodic symbol puncturing, and a proposed method to assess the performance of codes with a zero-output loop that are not catastrophic. As an example, the paper optimizes rate-1/4 unpunctured codes for Hamming weight under both bit-wise and symbol-wise periodic puncturing. Code tables and simulation results are included.},\n type={4},\n author = {Fragouli, C. and Komninakis, C. and Wesel, R. D.},\n journal = {ICC 2001, Helsinki, Finland, June},\n pages = {pages 300--304},\n tags = {channel_coding},\n title = {Minimality for puncturing convolutional codes},\n volume = {vol. 1},\n year = {2001}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper investigates encoders optimization for the Hamming weight after periodic puncturing, and discusses minimality issues that may affect the performance of the punctured encoders. Periodically puncturing a minimal encoder produces a higher rate encoder that may or may not be minimal. If it is not minimal, it may have a zero-output loop and it may be catastrophic. A code search can use a fast algorithm to determine whether an encoder's state diagram has a zero-output loop under periodic symbol puncturing, and a proposed method to assess the performance of codes with a zero-output loop that are not catastrophic. As an example, the paper optimizes rate-1/4 unpunctured codes for Hamming weight under both bit-wise and symbol-wise periodic puncturing. Code tables and simulation results are included.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-aldhahir-diggavi-turin-prefilteredspacetimembcjrequalizerformimofrequencyselectivechannels-2001\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  N. Al-Dhahir;  Suhas N. Diggavi;  and  W. Turin.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Prefiltered space-Time M-BCJR Equalizer for MIMO Frequency-Selective Channels.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>CISS</i>.  2001.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-aldhahir-diggavi-turin-prefilteredspacetimembcjrequalizerformimofrequencyselectivechannels-2001\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-aldhahir-diggavi-turin-prefilteredspacetimembcjrequalizerformimofrequencyselectivechannels-2001')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_prefiltered_2001,\n abstract = {This paper addresses the problem of soft equalization for time-variant frequency-selective channels. Such a channel arises in EDGE (Enhanced Data for GSM Evolution), third generation TDMA proposal, which employs 8-PSK modulation with a linearized GMSK pulse shaping filter that introduces strong intersymbol interference. The proposed equalization approach uses a prefilter to concetrate the effective channel power in a small number of taps, followed by a reduced complexity MAP equalizer to produce soft decision outputs. The MAP equalizer is based on the implementation of the M-algorithm in the log domain. The prefilter introduces residual intersymbol interference which degrades the performance of MAP when applied to the trellis of the shortened channel. However, the shape of the overall shortened channel impulse response allows the M-algorithm to approximate the prefiltered MAP performance with a small number of states. Based on this general framework, we investigate several enhancements, such as using a different prefilter for the forward and backward recursion, concatenating two trellis steps during decoding, and temporal oversampling. The performance is evaluated through simulations over the typical urban (TU) EDGE channel.},\n type={4},\n author = {Fragouli, C. and Al-Dhahir, N. and Diggavi, Suhas N. and Turin, W.},\n journal = {CISS},\n tags = {channel_coding},\n title = {Prefiltered space-{Time} {M}-{BCJR} {Equalizer} for {MIMO} {Frequency}-{Selective} {Channels}},\n year = {2001}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper addresses the problem of soft equalization for time-variant frequency-selective channels. Such a channel arises in EDGE (Enhanced Data for GSM Evolution), third generation TDMA proposal, which employs 8-PSK modulation with a linearized GMSK pulse shaping filter that introduces strong intersymbol interference. The proposed equalization approach uses a prefilter to concetrate the effective channel power in a small number of taps, followed by a reduced complexity MAP equalizer to produce soft decision outputs. The MAP equalizer is based on the implementation of the M-algorithm in the log domain. The prefilter introduces residual intersymbol interference which degrades the performance of MAP when applied to the trellis of the shortened channel. However, the shape of the overall shortened channel impulse response allows the M-algorithm to approximate the prefiltered MAP performance with a small number of states. Based on this general framework, we investigate several enhancements, such as using a different prefilter for the forward and backward recursion, concatenating two trellis steps during decoding, and temporal oversampling. The performance is evaluated through simulations over the typical urban (TU) EDGE channel.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-wesel-sommer-fettweis-turbocodeswithnonuniformconstellation-2001\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  R. D. Wesel;  D. Sommer;  and  G. P. Fettweis.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Turbo Codes with Non-Uniform Constellation.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>ICC 2001, Helsinki, Finland</i>, vol. 1: pages 70–73.  2001.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-wesel-sommer-fettweis-turbocodeswithnonuniformconstellation-2001\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-wesel-sommer-fettweis-turbocodeswithnonuniformconstellation-2001')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_turbo_2001-1,\n abstract = {This paper presents parallel concatenated turbo codes that employ a non-uniform constellation to achieve shaping gain. The output signal approximates the Gaussian distribution by using equally likely signals with unequal spacing (a non-uniform constellation). The small distance of points near the center of the constellation may lead to a small overall free distance and thus a high error floor for turbo codes. We avoid this situation by a two-step design procedure, that first creates an interleaver, and then identifies the constituent encoders that maximize the turbo code free distance. Simulation results for 4 bits/sec/Hz show that this use of shaping can offer an improvement of approximately 0.2 dB for turbo codes.},\n type={4},\n author = {Fragouli, C. and Wesel, R. D. and Sommer, D. and Fettweis, G. P.},\n journal = {ICC 2001, Helsinki, Finland},\n pages = {pages 70--73},\n tags = {channel_coding},\n title = {Turbo {Codes} with {Non}-{Uniform} {Constellation}},\n volume = {vol. 1},\n year = {2001}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper presents parallel concatenated turbo codes that employ a non-uniform constellation to achieve shaping gain. The output signal approximates the Gaussian distribution by using equally likely signals with unequal spacing (a non-uniform constellation). The small distance of points near the center of the constellation may lead to a small overall free distance and thus a high error floor for turbo codes. We avoid this situation by a two-step design procedure, that first creates an interleaver, and then identifies the constituent encoders that maximize the turbo code free distance. Simulation results for 4 bits/sec/Hz show that this use of shaping can offer an improvement of approximately 0.2 dB for turbo codes.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2000\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2000')\"\n      onkeypress=\"toggleGroup('group_2000')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2000</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"fragouli-seshadri-turin-onreducedtrellisequalizationusingthembcjralgorithm-2000\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  N. Seshadri;  and  W. Turin.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On reduced trellis equalization using the M-BCJR Algorithm.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>CISS</i>, volume 2, pages 1159–1163, March 2000. \n  <span class=\"note\">event-place: Boston</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-seshadri-turin-onreducedtrellisequalizationusingthembcjralgorithm-2000\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-seshadri-turin-onreducedtrellisequalizationusingthembcjralgorithm-2000')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{fragouli_reduced_2000,\n abstract = {The complexity of channel equalization using the BCJR algorithn [1] grows exponentially with the channel memory. The M-BCJR algorithm [2], provides a method for reduced-trellis channel equalization. This paper examines the algorithm performance for different finite impulse response channels, identifies pathological cases, and introduces designer choices such as the decision delay, maximum and minimum phase transformation, and selection of states used by the algorithm. Simulation results demonstrate the effect of the different parameters in the algorithm&#x27;s performance.},\n type={4},\n author = {Fragouli, C. and Seshadri, N. and Turin, W.},\n booktitle = {{CISS}},\n month = {March},\n note = {event-place: Boston},\n pages = {1159--1163},\n tags = {wireless,channel_coding},\n title = {On reduced trellis equalization using the {M}-{BCJR} {Algorithm}},\n volume = {2},\n year = {2000}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The complexity of channel equalization using the BCJR algorithn [1] grows exponentially with the channel memory. The M-BCJR algorithm [2], provides a method for reduced-trellis channel equalization. This paper examines the algorithm performance for different finite impulse response channels, identifies pathological cases, and introduces designer choices such as the decision delay, maximum and minimum phase transformation, and selection of states used by the algorithm. Simulation results demonstrate the effect of the different parameters in the algorithm's performance.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"komninakis-fragouli-sayed-wesel-adaptivemultiinputmultioutputfadingchannelequalizationusingkalmanestimation-2000\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Komninakis;  C. Fragouli;  A. H. Sayed;  and  R. D. Wesel.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Adaptive Multi-Input Multi-Output Fading Channel Equalization using Kalman Estimation.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>ICC 2000, New Orleans, Louisiana, June 18-22</i>, vol. 3: pages 1655–1659.  2000.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/komninakis-fragouli-sayed-wesel-adaptivemultiinputmultioutputfadingchannelequalizationusingkalmanestimation-2000\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('komninakis-fragouli-sayed-wesel-adaptivemultiinputmultioutputfadingchannelequalizationusingkalmanestimation-2000')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{komninakis_adaptive_2000,\n abstract = {This paper addresses the problem of adaptive channel tracking and equalization for multi-input multi-output (MIMO) time-variant frequency-selective channels. A finite-length minimum-mean-squared-error decision-feedback equalizer (MMSE-DFE) performs the equalization task, while a Kalman filter tracks the MIMO channel, which models the corrupting effects of inter-symbol interference (ISI), inter-user interference (IUI), and noise. The Kalman tracking is aided by previous hard decisions produced by the DFE, with a decision delay \\&amp;gt;0, which causes the Kalman filter to track the channel with a delay. A channel prediction module bridges the time gap between the channel estimates produced by the Kalman filter and those needed for the DFE adaptation. The proposed algorithm offers good tracking behavior for multi-user fading ISI channels at the expense of higher complexity.},\n type={4},\n author = {Komninakis, C. and Fragouli, C. and Sayed, A. H. and Wesel, R. D.},\n journal = {ICC 2000, New Orleans, Louisiana, June 18-22},\n pages = {pages 1655--1659},\n tags = {wireless},\n title = {Adaptive {Multi}-{Input} {Multi}-{Output} {Fading} {Channel} {Equalization} using {Kalman} {Estimation}},\n volume = {vol. 3},\n year = {2000}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper addresses the problem of adaptive channel tracking and equalization for multi-input multi-output (MIMO) time-variant frequency-selective channels. A finite-length minimum-mean-squared-error decision-feedback equalizer (MMSE-DFE) performs the equalization task, while a Kalman filter tracks the MIMO channel, which models the corrupting effects of inter-symbol interference (ISI), inter-user interference (IUI), and noise. The Kalman tracking is aided by previous hard decisions produced by the DFE, with a decision delay &gt;0, which causes the Kalman filter to track the channel with a delay. A channel prediction module bridges the time gap between the channel estimates produced by the Kalman filter and those needed for the DFE adaptation. The proposed algorithm offers good tracking behavior for multi-user fading ISI channels at the expense of higher complexity.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1999\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1999')\"\n      onkeypress=\"toggleGroup('group_1999')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1999</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"fragouli-wesel-convolutionalcodesandmatrixcontroltheory-1999\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  and  R. D. Wesel.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Convolutional codes and matrix control theory.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Proceedings of the 7th International Conference on Advances in Communications and Control, June 28-July 2, Athens, Greece.</i>.  1999.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-wesel-convolutionalcodesandmatrixcontroltheory-1999\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-wesel-convolutionalcodesandmatrixcontroltheory-1999')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_convolutional_1999,\n type={4},\n author = {Fragouli, C. and Wesel, R. D.},\n journal = {Proceedings of the 7th International Conference on Advances in Communications and Control, June 28-July 2, Athens, Greece.},\n tags = {channel_coding},\n title = {Convolutional codes and matrix control theory},\n year = {1999}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-wesel-semirandominterleaverdesigncriteria-1999\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  and  R. D. Wesel.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Semi-random interleaver design criteria.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Communication Theory Symposium at Globecom 99, Rio de Janeiro, Brazil, December 5-9</i>, 5: pages 2352–2356.  1999.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-wesel-semirandominterleaverdesigncriteria-1999\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-wesel-semirandominterleaverdesigncriteria-1999')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_semi-random_1999,\n abstract = {A spread interleaver of length N is a semi-random interleaver based on the random selection without replacement of N integers from 1 to N under a design constraint. This paper extends the spread-interleaver design method to multiple error events, based on the interleaver&#x27;s role in overall turbo code error event distances. The extension helps to explain why the spread interleaver is specifically designed to be semi-random. Simulation results show the performance achieved for a symbol-interleaved parallel concatenated trellis coded modulation (PCTCM) scheme.},\n type={4},\n author = {Fragouli, C. and Wesel, R. D.},\n journal = {Communication Theory Symposium at Globecom 99, Rio de Janeiro, Brazil, December 5-9},\n pages = {pages 2352--2356},\n tags = {channel_coding},\n title = {Semi-random interleaver design criteria},\n volume = {5},\n year = {1999}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  A spread interleaver of length N is a semi-random interleaver based on the random selection without replacement of N integers from 1 to N under a design constraint. This paper extends the spread-interleaver design method to multiple error events, based on the interleaver's role in overall turbo code error event distances. The extension helps to explain why the spread interleaver is specifically designed to be semi-random. Simulation results show the performance achieved for a symbol-interleaved parallel concatenated trellis coded modulation (PCTCM) scheme.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fragouli-wesel-symbolinterleavedparallelconcatenatedtrelliscodedmodulation-1999\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Fragouli;  and  R. D. Wesel.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Symbol interleaved parallel concatenated trellis coded modulation.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Communication Theory Miniconference in conjunction with ICC '99, June 6-10 1999</i>,pages 42 – 46.  1999.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fragouli-wesel-symbolinterleavedparallelconcatenatedtrelliscodedmodulation-1999\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('fragouli-wesel-symbolinterleavedparallelconcatenatedtrelliscodedmodulation-1999')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fragouli_symbol_1999,\n abstract = {This paper presents a method for efficient coding at high spectral efficiency using parallel concatenated trellis coded modulation (PCTCM) with symbol interleaving. The constituent encoders are optimized for symbol-wise free distance, and each has an infinite symbol-wise impulse response. In many cases of practical interest, the optimal structure for these constituent encoders connects the memory elements in a single row. Simulation results show that the performance is as close as 0.5 dB to the constrained capacity.},\n type={4},\n author = {Fragouli, C. and Wesel, R. D.},\n journal = {Communication Theory Miniconference in conjunction with ICC &#x27;99, June 6-10 1999},\n pages = {pages 42 -- 46},\n tags = {channel_coding},\n title = {Symbol interleaved parallel concatenated trellis coded modulation},\n year = {1999}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper presents a method for efficient coding at high spectral efficiency using parallel concatenated trellis coded modulation (PCTCM) with symbol interleaving. The constituent encoders are optimized for symbol-wise free distance, and each has an infinite symbol-wise impulse response. In many cases of practical interest, the optimal structure for these constituent encoders connects the memory elements in a single row. Simulation results show that the performance is as close as 0.5 dB to the constrained capacity.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"komninakis-fragouli-wesel-sayed-channelestimationandequalizationinfading-1999\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Komninakis;  C. Fragouli;  R. D. Wesel;  and  A. H. Sayed.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Channel estimation and equalization in fading.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>33rd Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, October 24-27</i>.  1999.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/komninakis-fragouli-wesel-sayed-channelestimationandequalizationinfading-1999\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('komninakis-fragouli-wesel-sayed-channelestimationandequalizationinfading-1999')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{komninakis_channel_1999,\n abstract = {This paper addresses the problem of training sequence design for multiple-antenna transmissions over quasi-static frequency-selective channels. To achieve the channel estimation minimum mean square error, the training sequences transmitted from the multiple antennas must have impulse-like auto correlation and zero cross correlation. We reduce the problem of designing multiple training sequences to the much easier and well-understood problem of designing a single training sequence with impulse-like auto correlation. To this end, we propose to encode the training symbols with a space-time code, that may be the same or different from the space-time code that encodes the information symbols. Optimal sequences do not exist for all training sequence lengths and constellation alphabets. We also propose a method to easily identify training sequences that belong to a standard 2m-PSK constellation for an arbitrary training sequence length and an arbitrary number of unknown channel taps. Performance bounds derived indicate that these sequences achieve near-optimum performance.},\n type={4},\n author = {Komninakis, C. and Fragouli, C. and Wesel, R. D. and Sayed, A. H.},\n journal = {33rd Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, October 24-27},\n tags = {wireless},\n title = {Channel estimation and equalization in fading},\n year = {1999}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper addresses the problem of training sequence design for multiple-antenna transmissions over quasi-static frequency-selective channels. To achieve the channel estimation minimum mean square error, the training sequences transmitted from the multiple antennas must have impulse-like auto correlation and zero cross correlation. We reduce the problem of designing multiple training sequences to the much easier and well-understood problem of designing a single training sequence with impulse-like auto correlation. To this end, we propose to encode the training symbols with a space-time code, that may be the same or different from the space-time code that encodes the information symbols. Optimal sequences do not exist for all training sequence lengths and constellation alphabets. We also propose a method to easily identify training sequences that belong to a standard 2m-PSK constellation for an arbitrary training sequence length and an arbitrary number of unknown channel taps. Performance bounds derived indicate that these sequences achieve near-optimum performance.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1998\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1998')\"\n      onkeypress=\"toggleGroup('group_1998')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1998</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"sivaraman-srivastava-fragouli-controlledmultimediawirelesslinksharingviaenhancedclassbasedqueuingwithchannelstatedependentpacketscheduling-1998\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   V. Sivaraman;  M. B. Srivastava;  and  C. Fragouli.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Controlled multimedia wireless link sharing via enhanced class-based queuing with channel-state-dependent packet scheduling.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Infocom</i>, vol. 2: pages 572–580.  1998.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/INFCOM.1998.665077\"\n     onclick=\"log_download('sivaraman-srivastava-fragouli-controlledmultimediawirelesslinksharingviaenhancedclassbasedqueuingwithchannelstatedependentpacketscheduling-1998', 'http://doi.org/10.1109/INFCOM.1998.665077', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sivaraman-srivastava-fragouli-controlledmultimediawirelesslinksharingviaenhancedclassbasedqueuingwithchannelstatedependentpacketscheduling-1998\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sivaraman-srivastava-fragouli-controlledmultimediawirelesslinksharingviaenhancedclassbasedqueuingwithchannelstatedependentpacketscheduling-1998')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{sivaraman_controlled_1998,\n abstract = {A key problem in transporting multimedia traffic across wireless networks is a controlled sharing of the wireless link by different packet streams. So far this problem has been treated as that of providing support for quality of service in time division multiplexing based medium access control protocols (MAC). Adopting a different perspective to the problem, this paper describes an approach based on extending the class-based queueing (CBQ) based controlled hierarchical link sharing model proposed for the Internet. Our scheme enhances CBQ, which works well in wired links such as point-to-point wires of fixed bandwidth, to also work well with wireless links based on radio channels that are (i) inherently shared on-demand among multiple radios, and (ii) are subject to highly dynamic bandwidth variations due to spatially and temporally varying fading with accompanying burst errors. The proposed scheme is based on combining a modified version of CBQ with channel-state dependent packet scheduling.},\n type={4},\n author = {Sivaraman, V. and Srivastava, M. B. and Fragouli, C.},\n doi = {10.1109/INFCOM.1998.665077},\n journal = {Infocom},\n pages = {pages 572--580},\n tags = {wireless},\n title = {Controlled multimedia wireless link sharing via enhanced class-based queuing with channel-state-dependent packet scheduling},\n volume = {vol. 2},\n year = {1998}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  A key problem in transporting multimedia traffic across wireless networks is a controlled sharing of the wireless link by different packet streams. So far this problem has been treated as that of providing support for quality of service in time division multiplexing based medium access control protocols (MAC). Adopting a different perspective to the problem, this paper describes an approach based on extending the class-based queueing (CBQ) based controlled hierarchical link sharing model proposed for the Internet. Our scheme enhances CBQ, which works well in wired links such as point-to-point wires of fixed bandwidth, to also work well with wireless links based on radio channels that are (i) inherently shared on-demand among multiple radios, and (ii) are subject to highly dynamic bandwidth variations due to spatially and temporally varying fading with accompanying burst errors. The proposed scheme is based on combining a modified version of CBQ with channel-state dependent packet scheduling.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1997\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1997')\"\n      onkeypress=\"toggleGroup('group_1997')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1997</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"lettieri-fragouli-srivastava-lowpowererrorcontrolforwirelesslinks-1997\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   P. Lettieri;  C. Fragouli;  and  M. B. Srivastava.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Low power error control for wireless links.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>ACM/IEEE Mobicom</i>,139–150.  1997.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1145/262116.262142\"\n     onclick=\"log_download('lettieri-fragouli-srivastava-lowpowererrorcontrolforwirelesslinks-1997', 'http://doi.org/10.1145/262116.262142', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/lettieri-fragouli-srivastava-lowpowererrorcontrolforwirelesslinks-1997\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('lettieri-fragouli-srivastava-lowpowererrorcontrolforwirelesslinks-1997')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{lettieri_low_1997,\n abstract = {Energy efficiency, which directly affects battery life and portability, is perhaps the single most important design metric in hand-held computing devices capable of mobile networking over wireless radio links. By virtue of their being relatively thin clients, a high fraction of the power consumption in portable wireless computing devices is accounted for by the transport of packet data over the wireless link. In particular, the error control strategy (eg. convolutional and block channel coding for forward error correction (FEC), ARQ protocols, hybrids) used for wireless link data transport has a direct impact on battery power consumption. Error control has traditionally been studied by channel coding researchers from the perspective of selecting an error control scheme to achieve a desired level of radio channel performance. We instead study the problem of error control from a perspective more relevant to battery operated devices: the amount of battery energy consumed to transmit bits across a wireless link. This includes both the physical transmission of useful and redundancy data, as well as the computation of the error control redundancy. We first describe a novel error control where the most battery energy efficient hybrid combination of an appropriate FEQ and ARQ protocol is chosen, and adapted over time, for each stream (ATM virtual circuit or IP/RSVP flow). Next, we present analysis and simulation results to guide the selection and adaptation of the most energy efficient error control scheme as a function of quality of service, packet size, and channel state.},\n type={4},\n author = {Lettieri, P. and Fragouli, C. and Srivastava, M. B.},\n doi = {10.1145/262116.262142},\n journal = {ACM/IEEE Mobicom},\n pages = {139--150},\n tags = {wireless},\n title = {Low power error control for wireless links},\n year = {1997}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Energy efficiency, which directly affects battery life and portability, is perhaps the single most important design metric in hand-held computing devices capable of mobile networking over wireless radio links. By virtue of their being relatively thin clients, a high fraction of the power consumption in portable wireless computing devices is accounted for by the transport of packet data over the wireless link. In particular, the error control strategy (eg. convolutional and block channel coding for forward error correction (FEC), ARQ protocols, hybrids) used for wireless link data transport has a direct impact on battery power consumption. Error control has traditionally been studied by channel coding researchers from the perspective of selecting an error control scheme to achieve a desired level of radio channel performance. We instead study the problem of error control from a perspective more relevant to battery operated devices: the amount of battery energy consumed to transmit bits across a wireless link. This includes both the physical transmission of useful and redundancy data, as well as the computation of the error control redundancy. We first describe a novel error control where the most battery energy efficient hybrid combination of an appropriate FEQ and ARQ protocol is chosen, and adapted over time, for each stream (ATM virtual circuit or IP/RSVP flow). Next, we present analysis and simulation results to guide the selection and adaptation of the most energy efficient error control scheme as a function of quality of service, packet size, and channel state.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n  </div>\n\n\n  <!-- Modal -->\n\n  <!-- <iframe id=\"bibbase_network_frame\" -->\n  <!--         src=\"//bibbase.org/network/control\" -->\n  <!--         style=\"display: none;\"> -->\n  <!-- </iframe> -->\n\n</div>\n"}; document.write(bibbase_data.data);